A signed bipartite graph G(U,V) is a bipartite graph in which each edge is assigned a positive or a negative sign. The signed degree of a vertex x in G(U, V) is the number of positive edges incident ...
This is a preview. Log in through your library . Abstract This paper investigates the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results
Feedback