A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers

DOI10.1016/j.ejc.2005.07.006zbMath1107.05079OpenAlexW2091213133WikidataQ114184878 ScholiaQ114184878MaRDI QIDQ854827

Akira Hiraki

Publication date: 7 December 2006

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2005.07.006

zbMATH Keywords

distance regular graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items (2)

On bounding the diameter of a distance-regular graph ⋮ A unified view of inequalities for distance-regular graphs. I

Cites Work

• On subgraphs in distance-regular graphs
• The diameter of bipartite distance-regular graphs
• Bipartite distance-regular graphs of valency three
• The dual of Pasch's axiom
• Characterization of projective incidence structures
• On uniformly geodetic graphs
• Applications of the retracing method for distance-regular graphs
• Distance-regular graphs and (s,c,a,k)-graphs
• A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
• Cubic Distance-Regular Graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A characterization of the odd graphs and the doubled odd graphs with a few of their intersection numbers