On 3-restricted edge connectivity of undirected binary Kautz graphs
From MaRDI portal
Publication:1011693
DOI10.1016/J.DISC.2007.12.079zbMath1163.05038OpenAlexW2015203371MaRDI QIDQ1011693
Xiaohong Cheng, Jianping Ou, Jichang Wu
Publication date: 9 April 2009
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.12.079
Related Items (4)
\(\{2,3\}\)-extraconnectivities of hypercube-like networks ⋮ On maximal 3-restricted edge connectivity and reliability analysis of hypercube networks ⋮ Conditional connectivity of star graph networks under embedding restriction ⋮ The \(k\)-restricted edge connectivity of undirected Kautz graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On computing a conditional edge-connectivity of a graph
- Fault-tolerant routings in Kautz and de Bruijn networks
- The spectrum of de Bruijn and Kautz graphs
- On a kind of restricted edge connectivity of graphs
- Sufficient conditions for \(\lambda'\)-optimality in graphs of diameter 2
- On connectivity of consecutive-\(d\) digraphs
- Conditional edge connectivity properties, reliability comparisons and transitivity of graphs
- Edge cuts leaving components of order at least \(m\)
- The Complexity of Counting Cuts and of Computing the Probability that a Graph is Connected
- Conditional connectivity
- Combinatorial optimization problems in the analysis and design of probabilistic networks
- Sufficient conditions for λ′‐optimality in graphs with girth g
This page was built for publication: On 3-restricted edge connectivity of undirected binary Kautz graphs
