The Menger number of the strong product of graphs

Discrete Mathematics

Volumn 313, Issue 13, 2013, Pages 1490-1495

  Abajo, E ^a   Casablanca, R M ^a   Dianez A ^a   Garcia Vazquez P ^a  

^a UNIVERSITY OF SEVILLE   (Spain)

Author keywords

Bounded edge connectivity; Edge deletion problem; Edge fault tolerant diameter; Menger number

Indexed keywords

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

References (10)

1. J. Cáceres, C. Hernando, M. Mora, I.M. Pelayo, M.L. Puertas, On the geodetic and the hull numbers in strong product graphs, Comput. Math. Appl. 60 (11) (2010) 3020-3031.
2. G. Chartrand, L. Lesniak, Graphs and Digraphs, Chapman and Hall/CRC, 2005.
3. A. Hellwig, L. Volkmann, Maximally edge-connected and vertex-connected graphs and digraphs:a survey, Discrete Math. 308 (15) (2008) 3265-3296. (Pubitemid 351657518)
4. H. Li, X. Li, Y. Sun, The generalized 3-connectivity of Cartesian product, Discrete Math. Theoret. Comput. Sci. 14 (1) (2012) 43-54.
5. L. Lovász, V. Neumann-Lara, M.D. Plummer, Mengerian theorems for paths of bounded length, Period. Math. Hungar. 9 (1978) 269-276.
6. M. Ma, J. Xu, Q. Zhu, The Menger number of the Cartesian product of graphs, Appl. Math. Lett. 24 (2011) 627-629.
7. J. Ou, On optimizing edge connectivity of product graphs, Discrete Math. 311 (6) (2011) 478-492.
8. S. Špacapan, Connectivity of strong products of graphs, Graphs Combin. 26 (2010) 457-467.
9. H. Whitney, Congruent graphs and the connectivity of graphs, Amer. J. Math. 54 (1932) 150-168.
10. D. Wood, Colouring the square of the cartesian product of trees, Discrete Math. Theoret. Comput. Sci. 13 (2) (2011) 109-112.