Kite-free \(P\)- and \(Q\)-polynomial schemes

DOI10.1007/BF01929487zbMath0832.05102OpenAlexW39023213MaRDI QIDQ1895824

Chih-Wen Weng

Publication date: 20 February 1996

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01929487

zbMATH Keywords

parametersassociation schemeconfigurationintersection numberkiteHamming schemedual polar scheme

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Related Items (5)

On strongly closed subgraphs with diameter two and the \(Q\)-polynomial property ⋮ Bipartite \(Q\)-polynomial distance-regular graphs and uniform posets ⋮ Parallelogram-free distance-regular graphs ⋮ Triangle-free distance-regular graphs ⋮ An equitable partition for a distance-regular graph of negative type

Cites Work

• The subconstituent algebra of an association scheme. I
• A new inequality for distance-regular graphs
• Kite-free distance-regular graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Kite-free \(P\)- and \(Q\)-polynomial schemes