On the uniqueness of the tetrahedral association schemes

DOI10.1016/0095-8956(77)90070-3zbMath0358.05011OpenAlexW2014926173MaRDI QIDQ1239160

Robert A. Liebler

Publication date: 1977

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

Full work available at URL: https://doi.org/10.1016/0095-8956(77)90070-3

Mathematics Subject Classification ID

Combinatorial aspects of block designs (05B05) Permutations, words, matrices (05A05) Graph theory (05C99)

Related Items (6)

A survey of some problems in combinatorial designs - a matrix approach ⋮ 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)\)

Cites Work

• Unnamed Item
• Unnamed Item
• Coherent configurations. I
• Eigenvalues of the adjacency matrix of tetrahedral graphs
• On Linear Associative Algebras Corresponding to Association Schemes of Partially Balanced Designs
• On the Uniqueness of the Triangular Association Scheme
• A characterization of tetrahedral graphs
• A characterization problem in graph theory
• Classification and Analysis of Partially Balanced Incomplete Block Designs with Two Associate Classes

This page was built for publication: On the uniqueness of the tetrahedral association schemes