On uniformly geodetic graphs

DOI10.1007/BF02988320zbMath0787.05061OpenAlexW2026244654MaRDI QIDQ1313350

Jack H. Koolen

Publication date: 26 January 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02988320

zbMATH Keywords

diameter bounduniformly geodetic graphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)

Related Items

A distance-regular graph with bipartite geodetically closed subgraphs. ⋮ On strongly closed subgraphs of highly regular graphs ⋮ A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers ⋮ On subgraphs in distance-regular graphs ⋮ Applications of the retracing method for distance-regular graphs ⋮ Steiner intervals, geodesic intervals, and betweenness ⋮ A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A new infinite series of regular uniformly geodetic code graphs
• Characterization of the odd graphs \(O_ k \)by parameters
• The dual of Pasch's axiom
• Characterization of projective incidence structures
• Classification of a class of distance-regular graphs via completely regular codes
• On \(F\)-geodetic graphs
• Distance-regular graphs and (s,c,a,k)-graphs