Title of article
Highly connected star product graphs
Author/Authors
Marcote، نويسنده , , X. and Balbuena، نويسنده , , C. and Garcيa-Vلzquez، نويسنده , , Michael P. and Valenzuela، نويسنده , , J.C.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2006
Pages
6
From page
91
To page
96
Abstract
In this work we approach the connectivity κ of a kind of product graphs that were introduced by J.C. Bermond et al. in 1984. More precisely, we provide lower bounds for κ, and state sufficient conditions that guarantee these product graphs to be maximally connected or superconnected. A main consequence is that even graphs with low connectivity may lead to highly connected larger (product) graphs.
Keywords
connectivity , superconnectivity , Cartesian Product
Journal title
Electronic Notes in Discrete Mathematics
Serial Year
2006
Journal title
Electronic Notes in Discrete Mathematics
Record number
1454420
Link To Document