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

DOI10.1006/EUJC.1997.0143zbMATH Open0884.05077OpenAlexW2000435950MaRDI QIDQ1372622FDOQ1372622

Authors: 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

Recommendations

• On the characterization of the folded Johnson graphs and the folded halved cubes by their intersection arrays
• On the characterization of the folded halved cubes by their intersection arrays
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

zbMATH Keywords

characterizationsdiameterdistance-regular graphintersection arrayfolded Johnson graph

Mathematics Subject Classification ID

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

Cited In (7)

• 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
• The graphs G(n,k) of the Johnson schemes are unique for n\(\geq 20\)
• The Johnson graph \(J(d,r)\) is unique if \((d,r)\neq (2,8)\)

This page was built for publication: Characterization of the folded Johnson graphs of small diameter by their intersection arrays

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