On Critical Graphs of Diameter 2
From MaRDI portal
Cited in
(20)- Regular separable graphs of minimum order with given diameter
- 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 the number of edges in a graph with many two-hop disjoint paths
- On a conjecture of Murty and Simon on diameter 2-critical graphs
- A characterization of \(P_5\)-free, diameter-2-critical graphs
- A maximum degree theorem for diameter-2-critical graphs
- A characterization of diameter-2-critical graphs with no antihole of length four
- A characterization of diameter-2-critical graphs whose complements are diamond-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
- Exponent-critical primitive graphs and the Kronecker product
- Property \(P_{d,m}\) and efficient design of reliable networks
- Robustness and strong attack tolerance of low-diameter networks
- All my favorite conjectures are critical
- Graph theory
- Perfect matchings in total domination critical graphs
- A proof of a conjecture on diameter 2-critical graphs whose complements are claw-free
- Diameter critical graphs
This page was built for publication: On Critical Graphs of Diameter 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5554160)
