Connectivity of Kautz networks
From MaRDI portal
Publication:685656
DOI10.1016/0012-365X(93)90355-WzbMATH Open0782.05053OpenAlexW2028396189MaRDI QIDQ685656FDOQ685656
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
Cites Work
- Line Digraph Iterations and the (d, k) Digraph Problem
- Fault-Tolerant Routing in DeBruijn Comrnunication Networks
- A Design for Directed Graphs with Minimum Diameter
- Connectivity of Regular Directed Graphs with Small Diameters
- Large fault-tolerant interconnection networks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
Cited In (8)
- A unified formulation of Kautz network and generalized hypercube
- Containment of butterflies in networks constructed by the line digraph operation
- The superconnectivity of large digraphs and graphs
- Super line-connectivity of consecutive-\(d\) digraphs
- Super edge-connectivity of de Bruijn and Kautz undirected graphs
- On the domination number of $t$-constrained de Bruijn graphs
- THE CONNECTIVITY OF EXCHANGED HYPERCUBES
- Title not available (Why is that?)
Recommendations
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Title not available (Why is that?) 👍 👎
- Kirchhoff indexes of a network 👍 👎
- On certain connectivity properties of the internet topology 👍 👎
- Connectivity in finite ad-hoc networks 👍 👎
- Connectedness and its applications 👍 👎
- Connectivity of Communication Networks 👍 👎
- Connectivity for Kite-Linked Graphs 👍 👎
This page was built for publication: Connectivity of Kautz networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685656)
