A characterization of tetrahedral graphs

DOI10.1016/S0021-9800(67)80104-2zbMath0155.31902OpenAlexW1973994998MaRDI QIDQ5538411

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

Related Items

Iterated \(k\)-line graphs, A characterization of the association schemes of bilinear forms, Classification of graphs by regularity, Discrete-time quantum walk search on Johnson graphs, Characterization of projective graphs, A characterization of complete matroid base graphs, On the uniqueness of the tetrahedral association schemes, Partial geometry of dimension three, Eigenvalues of the adjacency matrix of tetrahedral graphs, Characterizations of certain classes of graphs, Root systems and the Johnson and Hamming graphs, The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), A characterization of a class of regular 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, The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)