Graphs with small diameter after edge deletion

DOI10.1016/0166-218X(92)90126-UzbMath0773.05060MaRDI QIDQ1199416

Fan R. K. Chung

Publication date: 16 January 1993

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

zbMATH Keywords

diameteredge deletionminimum number of edges

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Related Items

Large fault-tolerant interconnection networks, Diameter critical graphs, Witness rectangle graphs, Complexity and algorithms for constant diameter augmentation problems, Exponent-critical primitive graphs and the Kronecker product

Cites Work

• On graphs with diameter 2
• Extremal graphs of diameter 4
• The diameter of random regular graphs
• The Diameter of a Cycle Plus a Random Matching
• An Extremal Problem of Graphs with Diameter 2
• Diameter bounds for altered graphs
• A problem of the theory of communication networks
• On some extremal graphs
• On Critical Graphs of Diameter 2
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item