On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays

DOI10.1006/EUJC.1995.0082MaRDI QIDQ5961463zbMATH OpenOpenAlexFDO

Authors Klaus Metsch

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

zbMATH Keywords

adjacency matrixdiameterdistance regular grapheigenvalueJohnson graphs

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Extremal problems in graph theory (05C35) Association schemes, strongly regular graphs (05E30) Distance in graphs (05C12) Structural characterization of families of graphs (05C75)

Recommendations

• Characterization of the folded Johnson graphs of small diameter by their intersection arrays
• On the characterization of the folded halved cubes by their intersection arrays
• scientific article; zbMATH DE number 3895117
• Characerization of a class of distance regular graphs.

Cited in

(5)

• A new class of transitive graphs
• On some recent progress in the classification of (\(P\) and \(Q\))-polynomial association schemes
• The Terwilliger polynomial of a \(Q\)-polynomial distance-regular graph and its application to pseudo-partition graphs
• On the characterization of the folded halved cubes by their intersection arrays
• A characterization of the Grassmann graphs

This page was built for publication: On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5961463)