Realizability and uniqueness in graphs

Abstract Consider a finite graph G ( V , E ). Let us associate to G a finite list P ( G ) of invariants. To any P the following two natural problems arise: (R) Realizability. Given P , when is P = P ( G ) for some graph G ?, (U) Uniqueness. Suppose P ( G )= P ( H ) for graphs G and H . When does this imply G ≅ H ? The best studied questions in this context are the degree realization problem for (R) and the reconstruction conjecture for (U). We discuss the problems (R) and (U) for the degree sequence and the size sequence of induced subgraphs for undirected and directed graphs, concentrating on the complexity of the corresponding decision problems and their connection to a natural search problem on graphs.

[1]  J. A. Bondy,et al.  Surveys in Combinatorics, 1991: “A Graph Reconstructor's Manual” , 1991 .

[2]  Frank K. Hwang,et al.  A Group Testing Problem on Two Disjoint Sets , 1981 .

[3]  D. Gale.  A theorem on flows in networks , 1957 .

[4]  Eberhard Triesch,et al.  Edge search in graphs and hypergraphs of bounded rank , 1993, Discret. Math..

[5]  Thomas Andreae,et al.  A search problem on graphs which generalizes some group testing problems with two defectives , 1991, Discret. Math..

[6]  Martin Aigner.  Combinatorial search , 1988 .

[7]  D. R. Fulkerson.  Zero-one matrices with zero trace. , 1960 .

[8]  Odile Favaron,et al.  On the residue of a graph , 1991, J. Graph Theory.

[9]  H. Landau.  On dominance relations and the structure of animal societies: III The condition for a score structure , 1953 .

[10]  Anna Lubiw,et al.  Some NP-Complete Problems Similar to Graph Isomorphism , 1981, SIAM J. Comput..

[11]  U. Peled,et al.  The polytope of degree sequences , 1989 .

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  S. Hakimi.  On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I , 1962 .

[14]  Eberhard Triesch,et al.  Reconstructing a Graph from its Neighborhood Lists , 1993, Comb. Probab. Comput..

[15]  D. R. Fulkerson,et al.  Multiplicities and minimal widths for (0,1)-matrices. , 1962 .

[16]  G. J. CHANG,et al.  Group testing with two defectives , 1982, Discret. Appl. Math..

[17]  H. Ryser.  Combinatorial Properties of Matrices of Zeros and Ones , 1957, Canadian Journal of Mathematics.

[18]  Peter Damaschke.  A Tight Upper Bound for Group Testing in Graphs , 1994, Discret. Appl. Math..

[19]  Martin Aigner.  Search problems on graphs , 1986, Discret. Appl. Math..