A characterization of the Doob graphs

DOI10.1006/JCTB.1995.1046MaRDI QIDQ1898733zbMATH OpenOpenAlexFDO

Authors Jack H. Koolen

Publication date 8 April 1996

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1006/jctb.1995.1046

zbMATH Keywords

Doob graphcartesian productcliqueslocal isomorphismShrikhande graph

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Structural characterization of families of graphs (05C75)

Recommendations

• Some properties of locally homogeneous graphs
• Tight 2-designs and perfect 1-codes in Doob graphs
• Additive perfect codes in Doob graphs
• MDS codes in Doob graphs
• Locally Shrikhande graphs and their automorphisms

Cited in

(1)

• Coverings and homotopy of a graph

This page was built for publication: A characterization of the Doob graphs

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