The maximum number of edges in a minimal graph of diameter 2
From MaRDI portal
Publication:3990877
DOI10.1002/jgt.3190160110zbMath0773.05063OpenAlexW2056567608MaRDI QIDQ3990877
Publication date: 28 June 1992
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: http://purl.umn.edu/4819
Related Items
A note on bipartite subgraphs and triangle-independent sets ⋮ The minimum number of edges in a vertex diameter-2-critical graph ⋮ A maximum degree theorem for diameter-2-critical graphs ⋮ A characterization of diameter-2-critical graphs with no antihole of length four ⋮ Diameter critical graphs ⋮ A characterization of diameter-2-critical graphs whose complements are diamond-free ⋮ A characterization of \(P_5\)-free, diameter-2-critical graphs ⋮ On a conjecture of Murty and Simon on diameter two critical graphs. II. ⋮ Perfect matchings in total domination critical graphs ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free ⋮ Total domination edge critical graphs with total domination number three and many dominating pairs ⋮ Progress on the Murty-Simon conjecture on diameter-2 critical graphs: a survey ⋮ On size, order, diameter and edge-connectivity of graphs ⋮ Almost every 2-SAT function is unate ⋮ On the existence of \(k\)-partite or \(K_p\)-free total domination edge-critical graphs ⋮ Properties of total domination edge-critical graphs ⋮ On a conjecture of Murty and Simon on diameter 2-critical graphs ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ Size in maximal triangle-free graphs and minimal graphs of diameter 2 ⋮ All My Favorite Conjectures Are Critical ⋮ The number of 2-SAT functions
