Arc fault tolerance of Kautz digraphs

DOI10.1016/J.TCS.2017.04.011zbMath1371.68215OpenAlexW2612188131MaRDI QIDQ2357375

Chanchan Zhou, Chun-Fang Li, Shang-Wei Lin

Publication date: 13 June 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.04.011

zbMATH Keywords

networkdigraphconnectivityfault toleranceKautz digraph

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Directed graphs (digraphs), tournaments (05C20) Reliability, testing and fault tolerance of networks and computer systems (68M15) Connectivity (05C40)

Related Items (1)

Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Vulnerability of super edge-connected networks
• Edge fault tolerance of graphs with respect to super edge connectivity
• Edge fault tolerance of super edge connectivity for three families of interconnection networks
• On the decycling number of generalized Kautz digraphs
• \(k\)-restricted edge connectivity in \((p+1)\)-clique-free graphs
• Super \(p\)-restricted edge connectivity of line graphs
• On the connectivity and restricted edge-connectivity of 3-arc graphs
• Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected
• On super edge-connectivity of product graphs
• The \(k\)-restricted edge connectivity of undirected Kautz graphs
• On computing a conditional edge-connectivity of a graph
• Super edge-connectivity of dense digraphs and graphs
• Edge-cuts leaving components of order at least three
• Restricted arc-connectivity of digraphs
• The maximal restricted edge connectivity of Kautz undirected graphs
• Maximally connected digraphs

This page was built for publication: Arc fault tolerance of Kautz digraphs