Grassmann graph

In graph theory, Grassmann graphs are a special class of simple graphs defined from systems of subspaces. The vertices of the Grassmann graph Template:Math are the Template:Mvar-dimensional subspaces of an Template:Mvar-dimensional vector space over a finite field of order Template:Mvar; two vertices are adjacent when their intersection is Template:Math-dimensional.

Many of the parameters of Grassmann graphs are [[Q-analog|Template:Mvar-analogs]] of the parameters of Johnson graphs, and Grassmann graphs have several of the same graph properties as Johnson graphs.

Graph-theoretic properties

• Template:Math is isomorphic to Template:Math.
• For all Template:Math, the intersection of any pair of vertices at distance Template:Mvar is Template:Math-dimensional.
• The clique number of Template:Math is given by an expression in terms its least and greatest eigenvalues Template:Math and Template:Math:

$\omega (J_q(n,k))=1-\frac{{\lambda }_{max}}{{\lambda }_{min}}$

Automorphism group

There is a distance-transitive subgroup of $\mathrm{Aut}(J_q(n,k))$ isomorphic to the projective linear group $\mathrm{P}\mathrm{\Gamma }\mathrm{L}(n,q)$.Template:Citation needed

In fact, unless $n=2k$ or $k\in \{1,n-1\}$, $\mathrm{Aut}(J_q(n,k))\cong \mathrm{P}\mathrm{\Gamma }\mathrm{L}(n,q)$; otherwise $\mathrm{Aut}(J_q(n,k))\cong \mathrm{P}\mathrm{\Gamma }\mathrm{L}(n,q)\times C_2$ or $\mathrm{Aut}(J_q(n,k))\cong \mathrm{Sym}([n{]}_q)$ respectively.

Intersection array

As a consequence of being distance-transitive, $J_q(n,k)$ is also distance-regular. Letting $d$ denote its diameter, the intersection array of $J_q(n,k)$ is given by $\{b_0,\dots ,b_{d-1};c_1,\dots c_d\}$ where:

• $b_j:=q^{2j+1}[k-j{]}_q[n-k-j{]}_q$ for all $0\le j<d$.
• $c_j:=([j{]}_q{)}^2$ for all $0<j\le d$.

Spectrum

• The characteristic polynomial of $J_q(n,k)$ is given by

$\phi (x):=\prod _{j=0}^{\mathrm{diam}(J_q(n,k))}{(x-(q^{j+1}[k-j{]}_q[n-k-j{]}_q-[j{]}_q))}^{({(\genfrac{}{}{0ex}{}{n}{j})}_q-{(\genfrac{}{}{0ex}{}{n}{j-1})}_q)}$.

See also

• Grassmannian
• Johnson graph