Connectivity of semicartesian products
From MaRDI portal
Publication:2051673
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.
Recommendations
Cites work
- A characterization of the edge connectivity of direct products of graphs
- A note on the connectivity of Kronecker products of graphs
- Connectivity of Cartesian product graphs
- Connectivity of Cartesian products of graphs
- Connectivity of Kronecker products with complete multipartite graphs
- Connectivity of lexicographic product and direct product of graphs.
- Connectivity of strong products of graphs
- On connectivity of the cartesian product of two graphs
- On edge connectivity of direct products of graphs
- Semi-Cartesian product of graphs
Cited in
(3)
This page was built for publication: Connectivity of semicartesian products
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2051673)
