Graphs of diameter two with no 4-circuits

DOI10.1016/S0012-365X(98)00321-5zbMath0930.05051OpenAlexW1983155670WikidataQ105675652 ScholiaQ105675652MaRDI QIDQ1301629

J. A. Bondy, Siemion Fajtlowicz

Publication date: 30 January 2000

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(98)00321-5

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Combinatorial aspects of finite geometries (05B25) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items (9)

Superconnectivity of graphs with odd girth \(g\) and even girth \(h\) ⋮ Uniformly dissociated graphs ⋮ Unnamed Item ⋮ Matching cutsets in graphs of diameter 2 ⋮ On the \(\lambda ^{\prime}\)-optimality in graphs with odd girth \(g\) and even girth \(h\) ⋮ Adjacency matrices of polarity graphs and of other \(C_{4}\)-free graphs of large size ⋮ On reverse degree distance ⋮ Some further results on the eccentric distance sum ⋮ On the Superconnectivity in graphs with odd girth g and even girth h

Cites Work

• Unnamed Item
• On Moore Graphs with Diameters 2 and 3
• MOORE GEOMETRIES AND RANK 3 GROUPS HAVING μ=1
• On Graphs that do not Contain a Thomsen Graph
• Polarities in finite projective planes

This page was built for publication: Graphs of diameter two with no 4-circuits