On connectivity of the Cartesian product of two graphs

Applied Mathematics and Computation

Volumn 102, Issue 2-3, 1999, Pages 129-137

  Chiue, Wen Sz ^a   Shieh, Bih Sheue ^a  

^a CHIA NAN UNIVERSITY OF PHARMACY AND SCIENCE   (Taiwan)

Author keywords

Cartesian product; Maximum connectivity; Super connectivity

Indexed keywords

EID: 0012419504     PISSN: 00963003     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0096-3003(98)10041-3     Document Type: Article

References (9)

1. Yang C.S., Wang J.F., Lee J.Y., Boesch F.T. Graph theoretic reliability analysis for the Boolean n-cube networks. IEEE Trans. Circuits Systems. CAS-35(9):1988;1175-1179.
2. Yang C.S., Wang J.F., Lee J.Y., Boesch F.T. The number of spanning trees of the regular networks. Inter. J. Comput. Math. 23:1988;185-200.
3. Lesniak L. Results on the edge-connectivity of graphs. Discrete Math. 8:1974;351-354.
4. Volkmann L. Edge-connectivity in p-partite graphs. J. Graph Theory. 13(1):1989;1-6.
5. Boland J.W., Ringeisen R.D. On super i-connected graphs. Networks. 24:1994;225-232.
6. Fàbrega J., Fiol M.A. Maximally connected digraphs. J. Graph Theory. 13:1989;657-668.
7. Soneoka T., Nakada H., Imase M. Sufficient conditions for maximally connected dense graphs. Discrete Math. 63:1987;53-66.
8. Fiol M.A. The super connectivity of large digraphs and graphs. Discrete Math. 124:1994;67-78.
9. Fiol M.A. On super-edge connected digraphs and bipartite digraphs. J. Graph Theory. 16(6):1992;545-555.