Size in maximal triangle-free graphs and minimal graphs of diameter 2

DOI10.1016/0012-365X(94)00190-TzbMath0821.05031MaRDI QIDQ1842148

Kathryn Fraughnaugh, Karen Casey, David C. Fisher, Frank Harary, Curtiss Barefoot

Publication date: 3 October 1995

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

trianglediametertriangle-free graphsdiameter-2 graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Related Items

Saturation spectrum of paths and stars ⋮ \(P_3\)-hull number of graphs with diameter two ⋮ Gaps in the saturation spectrum of trees ⋮ Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs ⋮ Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected ⋮ The saturation spectrum for antichains of subsets ⋮ On the saturation spectrum of families of cycle subdivisions ⋮ On fan-saturated graphs ⋮ On \((\mathrm{K}_t-e)\)-saturated graphs ⋮ The edge spectrum of the saturation number for small paths ⋮ Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph ⋮ Matching cutsets in graphs of diameter 2 ⋮ The edge spectrum of \(K_4^-\)-saturated graphs ⋮ The game of \(\mathcal F\)-saturator ⋮ Strengthening the Murty-Simon conjecture on diameter 2 critical graphs ⋮ Rainbow saturation

Cites Work

• Unnamed Item
• Unnamed Item
• On diameter 2-critical graphs
• On diameter critical graphs
• Parallel concepts in graph theory
• The maximum number of edges in a minimal graph of diameter 2
• On some extremal graphs
• On the Möbius Ladders
• On the theory of graphs

This page was built for publication: Size in maximal triangle-free graphs and minimal graphs of diameter 2