论文信息 - On the weak reconstruction of Cartesian-product graphs

On the weak reconstruction of Cartesian-product graphs

Abstract In this paper we reconstruct nontrivial connected Cartesian-product graphs from single vertex deleted subgraphs. We show that all one-vertex extensions of a given connected graph H , finite or infinite, to a nontrivial Cartesian product are isomorphic.

Wilfried Imrich | Janez Zerovnik | W. Imrich | J. Žerovnik

[1] Gert Sabidussi,et al. Graph multiplication , 1959 .

[2] Joan Feigenbaum,et al. A polynomial time algorithm for finding the prime factors of cartesian-product graphs , 1985, Discret. Appl. Math..

[3] Wilfried Imrich,et al. Embedding Graphs into Cartesian Products , 1989 .

[4] John C. Oxtoby,et al. Review: S. M. Ulam, A collection of mathematical problems , 1960 .

[5] Joan Feigenbaum,et al. On Factorable Extensions and Subgraphs of Prime Graphs , 1989, SIAM J. Discret. Math..

[6] S. Ulam. A collection of mathematical problems , 1960 .