Reconstructing a Graph from its Neighborhood Lists
1993 ◽
Vol 2
(2)
◽
pp. 103-113
◽
Associate to a finite labeled graph G(V, E) its multiset of neighborhoods (G) = {N(υ): υ ∈ V}. We discuss the question of when a list is realizable by a graph, and to what extent G is determined by (G). The main results are: the decision problem is NP-complete; for bipartite graphs the decision problem is polynomially equivalent to Graph Isomorphism; forests G are determined up to isomorphism by (G); and if G is connected bipartite and (H) = (G), then H is completely described.
2008 ◽
Vol Vol. 10 no. 3
(Graph and Algorithms)
◽
Keyword(s):
Keyword(s):
2005 ◽
Vol 145
(3)
◽
pp. 479-482
◽
Keyword(s):
2015 ◽
Vol 15
(01n02)
◽
pp. 1550008
2016 ◽
Vol 41
(3)
◽
pp. 163-181
Keyword(s):
Keyword(s):
2014 ◽
Vol Vol. 16 no. 3
◽
Keyword(s):
Keyword(s):