Diameter vulnerability of GC graphs
From MaRDI portal
Publication:1408451
DOI10.1016/S0166-218X(02)00594-2zbMath1020.05038MaRDI QIDQ1408451
Publication date: 22 September 2003
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
05C75: Structural characterization of families of graphs
05C12: Distance in graphs
05C20: Directed graphs (digraphs), tournaments
05C40: Connectivity
Cites Work
- Diameter vulnerability of graphs
- Large fault-tolerant interconnection networks
- Graphs on alphabets as models for large interconnection networks
- On the linegraph of a directed-graph
- Grands Graphes De Degré Et Diamètre Fixés
- Line Digraph Iterations and the (d, k) Digraph Problem
- Large Graphs with Given Degree and Diameter—Part I
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item