ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS-Reference-Cited by-同舟云学术

ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS

Published:2008-03 Issue:01 Volume:01 Page:93-98
ISSN:1793-5571
Container-title:Asian-European Journal of Mathematics
language:en
Short-container-title:Asian-European J. Math.

Author:

Klavžar Sandi¹²,Špacapan Simon³²

Affiliation:

1. Department of Mathematics and Computer Science, FNM, University of Maribor, Gosposvetska 84, 2000 Maribor, Slovenia

2. Institute of Mathematics, Physics and Mechanics, Jadranska 19, 1000 Ljubljana, Slovenia

3. University of Maribor, FME, Smetanova 17, 2000 Maribor, Slovenia

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

General Mathematics

Link

https://www.worldscientific.com/doi/pdf/10.1142/S1793557108000102

Reference11 articles.

1. List coloring of Cartesian products of graphs

2. On the Metric Dimension of Cartesian Products of Graphs

3. Geometry of Cuts and Metrics

4. On isometric embeddings of graphs

Cited by 23 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. The Restricted Edge-Connectivity of Strong Product Graphs;Axioms;2024-03-31

2. Strong subgraph 2-arc-connectivity and arc-strong connectivity of Cartesian product of digraphs;Discussiones Mathematicae Graph Theory;2022

3. Total Proper Connection and Graph Operations;Journal of Interconnection Networks;2021-06-20

4. Separation of Cartesian products of graphs into several connected components by the removal of edges;Applicable Analysis and Discrete Mathematics;2021

5. The Restricted Edge-Connectivity of Kronecker Product Graphs;Parallel Processing Letters;2019-09