Diameter vulnerability of GC graphs

DOI10.1016/S0166-218X(02)00594-2zbMath1020.05038MaRDI QIDQ1408451

D. Massart

Publication date: 22 September 2003

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

vulnerabilitycompound graphgraphs on alphabets(\(\varDelta,D,D',s\))-problemlarge graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Distance in graphs (05C12) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)

Related Items (1)

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

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

This page was built for publication: Diameter vulnerability of GC graphs