Characterization of the folded Johnson graphs of small diameter by their intersection arrays

DOI10.1006/EUJC.1997.0143zbMath0884.05077OpenAlexW2000435950MaRDI QIDQ1372622

Klaus Metsch

Publication date: 1 April 1998

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/eujc.1997.0143

zbMATH Keywords

characterizationsdistance-regular graphdiameterintersection arrayfolded Johnson graph

Mathematics Subject Classification ID

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: Characterization of the folded Johnson graphs of small diameter by their intersection arrays