The \(k\)-restricted edge connectivity of undirected Kautz graphs
From MaRDI portal
Publication:1044003
DOI10.1016/j.disc.2009.02.004zbMath1202.05082OpenAlexW2018584549MaRDI QIDQ1044003
Publication date: 10 December 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2009.02.004
Related Items
On restricted edge-connectivity of lexicographic product graphs ⋮ The partial diagnosability of interconnection networks under the hybrid PMC model ⋮ Conditional connectivity of recursive interconnection networks respect to embedding restriction ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ Arc fault tolerance of Kautz digraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Degree conditions for restricted-edge-connectivity and isoperimetric-edge-connectivity to be optimal
- Diameter-girth sufficient conditions for optimal extraconnectivity in graphs
- On 3-restricted edge connectivity of undirected binary Kautz graphs
- Sufficient conditions for super \(k\)-restricted edge connectivity in graphs of diameter 2
- On computing a conditional edge-connectivity of a graph
- On a kind of restricted edge connectivity of graphs
- Edge-cuts leaving components of order at least three
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Optimally super-edge-connected transitive graphs
- A proof of an inequality concerning \(k\)-restricted edge connectivity
- Edge cuts leaving components of order at least \(m\)
- Line Digraph Iterations and the (d, k) Digraph Problem
- The maximal restricted edge connectivity of Kautz undirected graphs
- Sufficient conditions for graphs to be ??-optimal, super-edge-connected, and maximally edge-connected
- Sufficient conditions for λ′‐optimality in graphs with girth g
