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

DOI10.1016/J.EJC.2005.07.006zbMATH Open1107.05079OpenAlexW2091213133WikidataQ114184878 ScholiaQ114184878MaRDI QIDQ854827FDOQ854827

Authors: 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

Recommendations

• An odd characterization of the generalized odd graphs
• A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
• scientific article; zbMATH DE number 870959
• scientific article; zbMATH DE number 1230485
• scientific article; zbMATH DE number 19218
• The \(p\)-intersection number of a complete bipartite graph and orthogonal double coverings of a clique
• scientific article; zbMATH DE number 4214056
• Characterization of Laborde-Mulder graphs (extended odd graphs)
• Characterization of graphs whose signature equals the number of odd cycles
• On the structure of certain intersection graphs

zbMATH Keywords

distance regular graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Cites Work

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

Cited In (4)

• A unified view of inequalities for distance-regular graphs. I
• A characterization of the doubled Grassmann graphs, the doubled Odd graphs, and the Odd graphs by strongly closed subgraphs
• On bounding the diameter of a distance-regular graph
• Graphs with odd cocliques

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q854827)