scientific article; zbMATH DE number 3853124

From MaRDI portal
Publication:3322137





[For the entire collection see Zbl 0523.00001.] A graph is called rayless if it does not contain an infinite path. Two graphs G and H are called hypomorphic if there exists a bijection \(\phi:V(G)\to V(H)\) such that, for each \(v\in V(G)\), the vertex deleted subgraphs G-v and \(H-\phi(v)\) are isomorphic. As the main result the following theorem is proved. Let G be an infinite rayless graph. Then there exists (up to isomorphism) at most one graph H such that G and H are non-isomorphic, hypomorphic graphs. In addition, an example is given which shows that, for certain G, a graph H like that may really exist. These results supplement previous investigations on the edge- reconstruction of infinite rayless graphs which are part of the author's doctoral dissertation [\textit{R. Schmidt}, Doctoral Diss., Hamburg (1982)].











This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3322137)