A characterization of tetrahedral graphs

DOI10.1016/S0021-9800(67)80104-2MaRDI QIDQ5538411zbMATH OpenOpenAlexFDO

Authors R. C. Bose, Renu C. Laskar

Publication date 1967

Published in Journal of Combinatorial Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0021-9800(67)80104-2

zbMATH Keywords

topology

Cited in

(17)

• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)
• A characterization of the association schemes of bilinear forms
• Classification of graphs by regularity
• Characterization of projective graphs
• A characterization of complete matroid base graphs
• On the uniqueness of the tetrahedral association schemes
• Partial geometry of dimension three
• Iterated k-line graphs
• Root systems and the Johnson and Hamming graphs
• Characterization of the graphs of the Johnson schemes G(3k,k) and G(3k+1,k)
• On the uniqueness of the graphs G(n,k) of the Johnson schemes
• Eigenvalues of the adjacency matrix of tetrahedral graphs
• A characterization of a class of regular graphs
• Characterizations of certain classes of graphs
• Discrete-time quantum walk search on Johnson graphs
• A Bose-Laskar-Hoffman theory for -bounded graphs with fixed smallest eigenvalue
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)

This page was built for publication: A characterization of tetrahedral graphs

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