On Conditional Connectivity of the Cartesian Product of Cycles
The conditional h-vertex (h-edge) connectivity of a connected graph H of minimum degree k > h is the size of a smallest vertex (edge) set F of H such that H − F is a disconnected graph of minimum degree at least h. Let G be the Cartesian product of r ≥ 1 cycles, each of length at least four and let...
Saved in:
| Main Authors: | , , |
|---|---|
| Format: | Artigo |
| Language: | Inglês |
| Published: |
University of Zielona Góra
2023-02-01
|
| Series: | Discussiones Mathematicae Graph Theory |
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2348 |
| Tags: |
No Tags, Be the first to tag this record!
|