| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4653100 | Electronic Notes in Discrete Mathematics | 2006 | 6 Pages |
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
