Vulnerability in graphs of diameter four
From MaRDI portal
Publication:1310232
DOI10.1016/0895-7177(93)90254-VzbMath0791.05033OpenAlexW2088617487MaRDI QIDQ1310232
Cheng-De Xu, Geoffrey Exoo, Frank Harary
Publication date: 28 June 1994
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(93)90254-v
Related Items (4)
Vulnerability in graphs of diameter five ⋮ Some extended results on diameter-stable graphs ⋮ Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree ⋮ A note on vulnerability in graphs of diameter five(II)
Cites Work
- Unnamed Item
- Mengerian theorems for paths of bounded length
- Parallel concepts in graph theory
- Counterexamples to theorems of Menger type for the diameter
- Graphs as models of communication network vulnerability: Connectivity and persistence
- On a measure of communication network vulnerability
- Geodetic connectivity of graphs
This page was built for publication: Vulnerability in graphs of diameter four
