Diameter vulnerability of graphs
From MaRDI portal
Publication:800372
DOI10.1016/0166-218X(84)90024-6zbMATH Open0549.05036MaRDI QIDQ800372FDOQ800372
Authors: Claudine Peyrat 
Publication date: 1984
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Connectivity (05C40)
Cites Work
Cited In (19)
- Edge vulnerability parameters of split graphs
- Diameter bounds for altered graphs
- Some diameter notions in lexicographic product of graphs
- Diameter vulnerability of graphs by edge deletion
- Sixty years of network reliability
- Diameter vulnerability of GC graphs
- A metric to compare vulnerability of the graphs of different sizes
- New bounds on the diameter vulnerability of iterated line digraphs
- Diameter-vulnerability of large bipartite digraphs
- Some network topological notions of the Mycielskian of a graph
- Minimum cutsets in hypercubes
- Vulnerability in graphs of diameter four
- Bounded edge-connectivity and edge-persistence of Cartesian product of graphs
- On large \((\Delta , D, D, 1)\)-graphs
- Bounds on the fault-diameter of graphs
- Large fault-tolerant interconnection networks
- Vulnerability in graphs of diameter five
- Title not available (Why is that?)
- Vulnerability of nearest neighbor graphs
This page was built for publication: Diameter vulnerability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q800372)
