Reconstructing the degree sequence and t
β
Thomas Andreae
π
Article
π
1982
π
Elsevier Science
π
English
β 812 KB
We prove that the degree sequence of an infinite graph is reconstructibjle from its family of vertex-deleted subgraphs. Furthermore, as another result concerning the reconstruction of infinite graphs, we prove that the number c(G) of components of an infinite graph G is re~ons~uct~b~e if there is at