An equitable partition for a distance-regular graph of negative type (Q2573642)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An equitable partition for a distance-regular graph of negative type |
scientific article; zbMATH DE number 2231435
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An equitable partition for a distance-regular graph of negative type |
scientific article; zbMATH DE number 2231435 |
Statements
An equitable partition for a distance-regular graph of negative type (English)
0 references
22 November 2005
0 references
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\).
0 references
distance-regular graph
0 references
Q-polynomial
0 references
classical parameters
0 references
Kite-free
0 references
