On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays
From MaRDI portal
Publication:5961463
DOI10.1006/eujc.1995.0082zbMath0867.05021OpenAlexW2010368404MaRDI QIDQ5961463
Publication date: 3 August 1997
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/eujc.1995.0082
Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75) Distance in graphs (05C12)
Related Items (3)
The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs ⋮ A new class of transitive graphs ⋮ On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
This page was built for publication: On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays
