Connectivity of semicartesian products (Q2051673)
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: Connectivity of semicartesian products |
scientific article; zbMATH DE number 7433083
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Connectivity of semicartesian products |
scientific article; zbMATH DE number 7433083 |
Statements
Connectivity of semicartesian products (English)
0 references
24 November 2021
0 references
Summary: Semicartesian product is defined on the basis of two special bipartite graphs and labeling of their vertices, and it has a pleasing property that it is composed of hexagonal structures. In this study, we give two formulae to calculate separately the connectivity and edge connectivity of a semicartesian product graph.
0 references
0.8039913773536682
0 references
0.7832635045051575
0 references
0.7820554971694946
0 references
0.7807888388633728
0 references
0.7790371179580688
0 references
