Primitive diameter 2-critical graphs

DOI10.2298/pim2429021rMaRDI QIDQ6585150

Jovan Radosavljević, Miodrag Živković, Zoran Stanić

Publication date: 9 August 2024

Published in: Publications de l'Institut Mathématique. Nouvelle Série (Search for Journal in Brave)

zbMATH Keywords

conediameterprimitive graphHamiltonian graphcritical graphself-centered graphErdős-Rényi theorem

Mathematics Subject Classification ID

Distance in graphs (05C12) Eulerian and Hamiltonian graphs (05C45)

Cites Work

• Unnamed Item
• Unnamed Item
• A maximum degree theorem for diameter-2-critical graphs
• A characterization of diameter-2-critical graphs with no antihole of length four
• Total domination edge critical graphs with total domination number three and many dominating pairs
• Regular graphs. A spectral approach
• Some notes on minimal self-centered graphs
• On diameter 2-critical graphs
• On diameter critical graphs
• On graphs with diameter 2
• A characterization for 2-self-centered graphs
• Strengthening the Murty-Simon conjecture on diameter 2 critical graphs
• A characterization of the non-trivial diameter two graphs of minimum size
• A characterization of \(P_5\)-free, diameter-2-critical graphs
• The maximum number of edges in a minimal graph of diameter 2
• Diameters in graphs
• Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree

This page was built for publication: Primitive diameter 2-critical graphs