On connectivity of the cartesian product of two graphs (Q1294201)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: On connectivity of the cartesian product of two graphs |
scientific article; zbMATH DE number 1311027
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On connectivity of the cartesian product of two graphs |
scientific article; zbMATH DE number 1311027 |
Statements
On connectivity of the cartesian product of two graphs (English)
0 references
5 December 1999
0 references
A graph \(G=(V,E)\) is maximum vertex-connected (maximum edge-connected) if its vertex-connectivity (edge-connectivity) equals \(\Bigl\lfloor \tfrac{2| E| }{| V| }\Bigr\rfloor \). Sufficient conditions for the cartesian product of two graphs to be maximum vertex-connected (maximum edge-connected) are given.
0 references
maximum connectivity
0 references
super connectivity
0 references
