Recommendations
Cites work
- scientific article; zbMATH DE number 3831957 (Why is no real title available?)
- scientific article; zbMATH DE number 3908346 (Why is no real title available?)
- scientific article; zbMATH DE number 3939392 (Why is no real title available?)
- scientific article; zbMATH DE number 4110714 (Why is no real title available?)
- scientific article; zbMATH DE number 6004 (Why is no real title available?)
- scientific article; zbMATH DE number 3893253 (Why is no real title available?)
- scientific article; zbMATH DE number 3218572 (Why is no real title available?)
- Diameter vulnerability of graphs
- Grands Graphes De Degré Et Diamètre Fixés
- Graphs on alphabets as models for large interconnection networks
- Large Graphs with Given Degree and Diameter—Part I
- Large fault-tolerant interconnection networks
- Line Digraph Iterations and the (d, k) Digraph Problem
- On a problem of a. kotzig concerning factorizations of 4‐regular graphs
- On the linegraph of a directed-graph
Cited in
(2)
This page was built for publication: Diameter vulnerability of GC graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1408451)