Connectivity of Kautz networks

DOI10.1016/0012-365X(93)90355-WzbMath0782.05053OpenAlexW2028396189MaRDI QIDQ685656

N. Homobono, Claudine Peyrat, Jean-Claude Bermond

Publication date: 24 October 1993

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(93)90355-w

zbMATH Keywords

connectivityminimum degreefault-tolerant networksKautz graphs

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)

Related Items (7)

Containment of butterflies in networks constructed by the line digraph operation ⋮ A unified formulation of Kautz network and generalized hypercube ⋮ Super line-connectivity of consecutive-\(d\) digraphs ⋮ On the domination number of $t$-constrained de Bruijn graphs ⋮ THE CONNECTIVITY OF EXCHANGED HYPERCUBES ⋮ Super edge-connectivity of de Bruijn and Kautz undirected graphs ⋮ The superconnectivity of large digraphs and graphs

Cites Work

• Large fault-tolerant interconnection networks
• Connectivity of Regular Directed Graphs with Small Diameters
• Line Digraph Iterations and the (d, k) Digraph Problem
• A Design for Directed Graphs with Minimum Diameter
• Fault-Tolerant Routing in DeBruijn Comrnunication Networks
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Connectivity of Kautz networks