ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
Authors:
- 1 March 2008
- journal article
- research article
- Published by World Scientific Pub Co Pte Ltd in Asian-European Journal of Mathematics
- Vol. 01 (01) , 93-98
Abstract
A short proof for the closed expression of the edge-connectivity of Cartesian product graphs is given and the structure of minimum edge cuts is described. It is also proved that the connectivity and edge-connectivity of an arbitrary Cartesian power equals its minimum degree.Keywords
This publication has 8 references indexed in Scilit:
- Recognizing Cartesian products in linear timeDiscrete Mathematics, 2007
- On the Metric Dimension of Cartesian Products of GraphsSIAM Journal on Discrete Mathematics, 2007
- List coloring of Cartesian products of graphsDiscrete Mathematics, 2006
- Distinguishing Cartesian powers of graphsJournal of Graph Theory, 2006
- Connectivity of Cartesian product graphsDiscrete Mathematics, 2006
- Geometry of Cuts and Metrics1997
- On isometric embeddings of graphsTransactions of the American Mathematical Society, 1985
- Graphs with Given Group and Given Graph-Theoretical PropertiesCanadian Journal of Mathematics, 1957