Diameter vulnerability of graphs by edge deletion

DOI10.1016/j.disc.2008.01.006zbMath1169.05320OpenAlexW2170215361MaRDI QIDQ1011748

He-Xi Ye, Chao Yang, Jun-Ming Xu

Publication date: 9 April 2009

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

Full work available at URL: https://doi.org/10.1016/j.disc.2008.01.006

zbMATH Keywords

diameterdiameter vulnerabilityedge-deletionedge-connected graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items (5)

Minimum diameter and t_F(f, q) ⋮ DIAMETER VULNERABILITY OF DIRECTED CYCLES AND DIRECTED TORI ⋮ The diameter vulnerability of the generalized Petersen graphGP[tk;k] ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ Some diameter notions in lexicographic product of graphs

Cites Work

• Diameter vulnerability of graphs
• Diameter increase caused by edge deletion
• Theory and Application of Graphs
• Diameter bounds for altered graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Diameter vulnerability of graphs by edge deletion