A characterization of the Tm graph

DOI10.1016/S0021-9800(69)80085-2zbMath0182.58003OpenAlexW2058755883MaRDI QIDQ5572948

Thomas A. Dowling

Publication date: 1969

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

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

zbMATH Keywords

topology

Related Items (8)

A characterization of the association schemes of bilinear forms ⋮ Characterization of the odd graphs \(O_ k \)by parameters ⋮ A characterization of complete matroid base 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 ⋮ 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)\)

This page was built for publication: A characterization of the Tm graph