Vulnerability in graphs of diameter four

DOI10.1016/0895-7177(93)90254-VzbMATH Open0791.05033OpenAlexW2088617487MaRDI QIDQ1310232FDOQ1310232

Authors: Geoffrey Exoo, Frank Harary, Chengde Xu 

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

Recommendations

• Diameter vulnerability of graphs by edge deletion
• Diameter vulnerability of graphs
• Graphs with small diameter after edge deletion
• Diameter, edge-connectivity, and \(C_4\)-freeness
• scientific article; zbMATH DE number 4110714

zbMATH Keywords

distancediameter

Mathematics Subject Classification ID

Distance in graphs (05C12)

Cites Work

• Parallel concepts in graph theory
• Geodetic connectivity of graphs
• Mengerian theorems for paths of bounded length
• Graphs as models of communication network vulnerability: Connectivity and persistence
• On a measure of communication network vulnerability
• Title not available (Why is that?)
• Counterexamples to theorems of Menger type for the diameter

Cited In (6)

• Realizability ofp-point,q-line graphs with prescribed maximum degree and line connectivity or minimum degree
• Some extended results on diameter-stable graphs
• Diameter-vulnerability of large bipartite digraphs
• A note on vulnerability in graphs of diameter five(II)
• Extremal graphs of diameter at most 6 after deleting any vertex
• Vulnerability in graphs of diameter five

This page was built for publication: Vulnerability in graphs of diameter four

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