Diameter vulnerability of graphs
From MaRDI portal
Publication:800372
DOI10.1016/0166-218X(84)90024-6zbMath0549.05036MaRDI QIDQ800372
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Connectivity (05C40)
Related Items
Sixty years of network reliability, Some network topological notions of the Mycielskian of a graph, Large fault-tolerant interconnection networks, Diameter vulnerability of GC graphs, Bounded edge-connectivity and edge-persistence of Cartesian product of graphs, Minimum cutsets in hypercubes, Diameter vulnerability of graphs by edge deletion, On large (Δ, D, D, 1)-graphs, Some diameter notions in lexicographic product of graphs
Cites Work
