A new family of distance-regular graphs and the \(\{ 0,1,2 \}\)-cliques in dual polar graphs
From MaRDI portal
Publication:1193540
DOI10.1016/0195-6698(92)90038-2zbMath0762.05041MaRDI QIDQ1193540
Joe Hemmeter, Andries E. Brouwer
Publication date: 27 September 1992
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0195-6698(92)90038-2
05E30: Association schemes, strongly regular graphs
05C75: Structural characterization of families of graphs
05C12: Distance in graphs
Related Items
There are only finitely many distance-regular graphs of fixed valency greater than two, The subconstituent algebra of an association scheme. I, Delsarte clique graphs, Finite primitive distance-transitive graphs, The last subconstituent of the Hemmeter graph, Distance-regular graphs of large diameter that are completely regular clique graphs, Large \(\{0,1,\ldots,t\}\)-cliques in dual polar graphs, Unification of graph products and compatibility with switching, Classification of the maximal cliques of size \(\geq q+4\) in the quadratic forms graph in odd characteristic, The complete list of maximal cliques of Quad\((n,q)\), \(q\) odd, Maximal sets of \(k\)-spaces pairwise intersecting in at least a \((k-2)\)-space, The largest Erdős-Ko-Rado sets of planes in finite projective and finite classical polar spaces, Theorems of Erdős-Ko-Rado type in geometrical settings, Non-trivial \(t\)-intersecting families for symplectic polar spaces
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the maximal cliques of the quadratic forms graph in even characteristic
- On a new family of (P and Q)-polynomial schemes
- The structure of near polygons with quads
- Association schemes of quadratic forms
- Distance-regular graphs and halved graphs
- The large cliques in the graph of quadratic forms
- Near \(n\)-gons and line systems
- Dual polar spaces
- Classification of the maximal cliques of size \(\geq q+4\) in the quadratic forms graph in odd characteristic
