On the edge-connectivity and restricted edge-connectivity of a product of graphs (Q2462383): Difference between revisions
From MaRDI portal
Latest revision as of 12:44, 27 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the edge-connectivity and restricted edge-connectivity of a product of graphs |
scientific article |
Statements
On the edge-connectivity and restricted edge-connectivity of a product of graphs (English)
0 references
30 November 2007
0 references
The paper considers the product graphs introduced by Bermond et al. as a natural generalization of permutation graphs. The authors provide bounds for the two parameters, edge-connectivity and restricted edge-connectivity. Sufficient conditions are presented to guarantee optimal values of these parameters for product graphs. The results are compared with other previous results for the connectivity of permutation graphs and Cartesian product graphs.
0 references
edge-connectivity
0 references
restricted edge-connectivity
0 references
permutation graphs
0 references
Cartesian product.
0 references
