On the tetrahedral graph

DOI10.2140/pjm.1968.25.219zbMath0157.31402OpenAlexW2083855539MaRDI QIDQ2527467

Martin Aigner

Publication date: 1968

Published in: Pacific Journal of Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2140/pjm.1968.25.219

zbMATH Keywords

topology

Related Items

Characterization of the odd graphs \(O_ k \)by parameters, Root systems and the Johnson and Hamming graphs, The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\), 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)\)