On Critical Graphs of Diameter 2

DOI10.2307/2688184zbMath0167.22102OpenAlexW4237100566MaRDI QIDQ5554160

U. S. R. Murty

Publication date: 1968

Full work available at URL: https://doi.org/10.2307/2688184

zbMATH Keywords

topology

Related Items (20)

Property P_d,m and efficient design of reliable networks ⋮ Robustness and Strong Attack Tolerance of Low-Diameter Networks ⋮ A maximum degree theorem for diameter-2-critical graphs ⋮ On the number of edges in a graph with many two-hop disjoint paths ⋮ Regular separable graphs of minimum order with given diameter ⋮ 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 ⋮ Perfect matchings in total domination critical graphs ⋮ 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 ⋮ The ubiquitous Petersen graph ⋮ Graphs with small diameter after edge deletion ⋮ Optimal design and augmentation of strongly attack-tolerant two-hop clusters in directed networks ⋮ On a conjecture of Murty and Simon on diameter 2-critical graphs ⋮ Graph theory ⋮ All My Favorite Conjectures Are Critical ⋮ Exponent-critical primitive graphs and the Kronecker product

This page was built for publication: On Critical Graphs of Diameter 2