On large (Δ, D, D, 1)-graphs
From MaRDI portal
Publication:3087616
DOI10.1002/net.20401zbMath1223.05254OpenAlexW1986133547MaRDI QIDQ3087616
No author found.
Publication date: 16 August 2011
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.20401
interconnection networksvulnerabilityproduct of graphsDlarge graphscompound graphs\((\DeltaD^{\prime}s)\)-problem
Paths and cycles (05C38) Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Unnamed Item
- Unnamed Item
- Large graphs with given degree and diameter. II
- Diameter vulnerability of graphs
- Vertex vulnerability parameters of Kronecker products of complete graphs
- Large fault-tolerant interconnection networks
- The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
- There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
- The vulnerability of the diameter of folded \(n\)-cubes
- Diameter vulnerability of GC graphs
- Line digraph iterations and diameter vulnerability
- Large \((d,D, D',s)\)-bipartite digraphs
- Diameter vulnerability of iterated line digraphs
- On the diameter vulnerability of Kautz digraphs
- Diameter-vulnerability of large bipartite digraphs
- Moore graphs and beyond: a survey of the degree/diameter problem
- On Moore Graphs with Diameters 2 and 3
- Line Digraph Iterations and the (d, k) Digraph Problem
- Algebraic Graph Theory
- Diameter vulnerability of iterated line digraphs in terms of the girth
- Diameter bounds for altered graphs
- Minimal Regular Graphs of Girths Eight and Twelve
- On the Construction of (d, k) Graphs
- Graphs with Maximal Even Girth
- New bounds on the diameter vulnerability of iterated line digraphs
This page was built for publication: On large (Δ, D, D, 1)-graphs
