On a conjecture of Murty and Simon on diameter two critical graphs. II.
From MaRDI portal
Publication:658055
DOI10.1016/j.disc.2011.09.022zbMath1232.05066OpenAlexW2041387863WikidataQ123027344 ScholiaQ123027344MaRDI QIDQ658055
Teresa W. Haynes, Anders Yeo, Michael A. Henning
Publication date: 11 January 2012
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2011.09.022
Extremal problems in graph theory (05C35) Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
A maximum degree theorem for diameter-2-critical graphs ⋮ A characterization of diameter-2-critical graphs whose complements are diamond-free ⋮ A characterization of \(P_5\)-free, diameter-2-critical graphs ⋮ 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 ⋮ Total edge critical graphs with leaves ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ All My Favorite Conjectures Are Critical
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- A survey of selected recent results on total domination in graphs
- On diameter 2-critical graphs
- On diameter critical graphs
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- The maximum number of edges in a minimal graph of diameter 2
This page was built for publication: On a conjecture of Murty and Simon on diameter two critical graphs. II.