An equitable partition for a distance-regular graph of negative type

DOI10.1016/J.JCTB.2005.02.007MaRDI QIDQ2573642zbMATH OpenOpenAlexFDO

Authors Štefko Miklavič

Publication date 22 November 2005

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.jctb.2005.02.007

zbMATH Keywords

classical parametersdistance-regular graphKite-freeQ-polynomial

Mathematics Subject Classification ID

Association schemes, strongly regular graphs (05E30)

Review text

Let \(\Gamma\) be a distance-regular graph with classical parameters \((d,b,\alpha,\beta)\) where \(b<-1\) and \(d\geq3\). In the paper under review the author discusses the 1-homogeneous and Q-polynomial property of \(T\).

Cites work

• \(Q\)-polynomial distance-regular graphs with \(a_1=0\)
• A new inequality for distance-regular graphs
• Classical distance-regular graphs of negative type
• Homogeneous graphs and regular near polygons
• scientific article; zbMATH DE number 43547 (Why is no real title available?)
• Kite-free \(P\)- and \(Q\)-polynomial schemes
• Kite-free distance-regular graphs
• Problems in algebraic combinatorics
• Weak-geodetically closed subgraphs in distance-regular graphs

Cited in

(2)

• An equitable partition for the distance-regular graph of the bilinear forms
• The Terwilliger algebra of a distance-regular graph of negative type

This page was built for publication: An equitable partition for a distance-regular graph of negative type

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