Weak reconstruction of strong product graphs

Discrete Mathematics

Volumn 307, Issue 3-5, 2007, Pages 641-649

  Zmazek, Blaž ^a   Žerovnik, Janez ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Composite graphs; Graph; Reconstruction problem; Strong product

Indexed keywords

IMAGE RECONSTRUCTION; NUMERICAL METHODS; PROBLEM SOLVING;

COMPOSITE GRAPHS; RECONSTRUCTION PROBLEM; STRONG PRODUCT;

GRAPH THEORY;

EID: 33845674689     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2005.09.049     Document Type: Article

References (11)

1. Dörfler W. Some results on the reconstruction of graphs. Colloq. Math. Soc. Janos Bolyai 10 (1973) 361-383
2. Dörfler W., and Imrich W. Über das starke Produkt von endlichen Graphen. Österreich. Akad. Wiss., Mathem.-Natur. Kl. S.-B. II 178 (1969) 247-262
3. Feigenbaum J., and Schäffer A.A. Finding the prime factors of strong direct product graphs in polynomial time. Discrete Math. 109 (1992) 77-102
4. Hagauer J., and Žerovnik J. An algorithm for the weak reconstruction of Cartesian-product graphs. J. Combin. Inf. Syst. Sci. 24 (1999) 87-103
5. Imrich W., and Klavžar S. Product Graphs: Structure and Recognition (2000), Wiley, New York
6. Imrich W., and Žerovnik J. On the weak reconstruction of Cartesian-product graphs. Discrete Math. 150 (1996) 167-178
7. Imrich W., Zmazek B., and Žerovnik J. Weak k-reconstruction of Cartesian products. Discuss. Math. Graph Theory 23 (2003) 273-285
8. McKenzie R. Cardinal multiplication of structures with a reflexive relation. Fund. Math. LXX (1971) 59-101
9. Sabidussi G. Graph multiplication. Math. Z. 72 (1960) 446-457
10. Sims J., and Holton D.A. Stability of Cartesian products. J. Combin. Theory Ser. B 25 (1978) 258-282
11. Ulam S.M. A Collection of Mathematical Problems (1960), Wiley, New York p. 29