Connectivity of strong products of graphs

Graphs and Combinatorics

Volumn 26, Issue 3, 2010, Pages 457-467

  Špacapan, Simon ^a  

^a UNIVERSITY OF MARIBOR   (Slovenia)

Author keywords

Connectivity; Strong product

Indexed keywords

EID: 77952322296     PISSN: 09110119     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00373-010-0919-8     Document Type: Article

References (19)

1. Balbuena C., Cera M., Diánez A., García-Vázquez P., Marcote X.: On the edge-connectivity and restricted edge-connectivity of a product of graphs. Discrete Appl. Math. 155, 2444-2455 (2007).
2. Balbuena C., Marcote X., García-Vázquez P.: On restricted connectivities of permutation graphs. Networks 45, 113-118 (2005).
3. Bohman T.: A limit theorem for the Shannon capacities of odd cycles II. Proc. Amer. Math. Soc. 133, 537-543 (2005) (electronic).
4. Brešar B., Špacapan S.: Edge connectivity of strong products of graphs. Discuss. Math. Graph Theory 27(2), 333-343 (2007).
5. Brešar, B., Špacapan, S.: Connectivity of direct products of graphs. Australas. J. Comb. (in press).
6. Chiue W. S., Shieh B. S.: On connectivity of the Cartesian product of two graphs. Appl. Math. Comput. 102, 129-137 (1999).
7. Codenotti B., Gerace I., Resta G.: Some remarks on the Shannon capacity of odd cycles. Ars Combin. 66, 243-257 (2003).
8. Dörfler W., Imrich W.: Über das starke Produkt von endlichen Graphen. Österreich. Akad. Wiss. Math.-Natur. Kl. S.-B. II 178, 247-262 (1970).
9. Goddard W., Raines M. E., Slater P. J.: Distance and connectivity measures in permutation graphs. Discrete Math. 271, 61-70 (2003).
10. Imrich W., Klavžar S.: Product Graphs: Structure and Recognition. Wiley, New York (2000).
11. Jerebic J., Klavžar S.: On induced and isometric embeddings of graphs into the strong product of paths. Dicrete Math. 306, 1358-1363 (2006).
12. Klavžar S., Špacapan S.: On the edge-connectivity of Cartesian product graphs. Asian-Eur. J. Math. 1, 93-98 (2008).
13. Körner J., Pilotto C., Simonyi G.: Local chromatic number and Sperner capacity. J. Combin. Theory Ser. B 95, 101-117 (2005).
14. Král D., Maxová J., Šámal R., Podbrdský P.: Hamilton cycles in strong products of graphs. J. Graph Theory 48, 299-321 (2005).
15. Král D., Stacho L.: Hamiltonian threshold for strong products of graphs. J. Graph Theory 58, 314-328 (2008).
16. McKenzie R.: Cardinal multiplication of structures with a reflexive relation. Fund. Math. 70, 59-101 (1971).
17. Piazza B. L., Ringeisen R. D.: Connectivity of generalized prisms over G. Discrete Appl. Math. 30, 229-233 (1991).
18. Špacapan S.: Connectivity of Cartesian products of graphs. Appl. Math. Lett. 21, 682-685 (2008).
19. 7. Inform. Process. Lett. 81, 277-282 (2002).