On large ( , D, D, 1)-graphs

DOI10.1002/NET.20401MaRDI QIDQ3087616zbMATH OpenOpenAlexFDO

Authors

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

zbMATH Keywords

interconnection networksvulnerabilityproduct of graphsDlarge graphscompound graphs\((\DeltaD^{\prime}s)\)-problem

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Paths and cycles (05C38) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Diameter vulnerability of GC graphs
• scientific article; zbMATH DE number 4110714
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
• Some new large (Δ, 3)‐graphs
• scientific article; zbMATH DE number 3908346

Cites work

• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• scientific article; zbMATH DE number 1339493 (Why is no real title available?)
• Algebraic Graph Theory
• Diameter bounds for altered graphs
• Diameter vulnerability of GC graphs
• Diameter vulnerability of graphs
• Diameter vulnerability of iterated line digraphs
• Diameter vulnerability of iterated line digraphs in terms of the girth
• Diameter-vulnerability of large bipartite digraphs
• Graphs with Maximal Even Girth
• Large (d,D, D',s)-bipartite digraphs
• Large fault-tolerant interconnection networks
• Large graphs with given degree and diameter. II
• Line Digraph Iterations and the (d, k) Digraph Problem
• Line digraph iterations and diameter vulnerability
• Minimal Regular Graphs of Girths Eight and Twelve
• Moore graphs and beyond: a survey of the degree/diameter problem
• New bounds on the diameter vulnerability of iterated line digraphs
• On Moore Graphs with Diameters 2 and 3
• On the Construction of (d, k) Graphs
• On the diameter vulnerability of Kautz digraphs
• The \((\Delta{} , d, d', \Delta{} - 1)\)-problem with applications to computer networks
• The vulnerability of the diameter of folded \(n\)-cubes
• There exists no distance-regular graph with intersection array \((5,4,3;1,1,2)\)
• Vertex vulnerability parameters of Kronecker products of complete graphs

Cited in

(5)

• Diameter vulnerability of GC graphs
• scientific article; zbMATH DE number 5941304 (Why is no real title available?)
• On large vertex-symmetric digraphs
• scientific article; zbMATH DE number 3908346 (Why is no real title available?)
• Asymptotically optimal \((\Delta, D', s)\)-digraphs

This page was built for publication: On large \((\Delta , D, D, 1)\)-graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087616)