Grassmann graph

Uses your system voice; voice and rate in settings.

Snapshot

≈ 2 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

In graph theory, Grassmann graphs are a special class of simple graphs defined from systems of subspaces. The vertices of the Grassmann graph are the -dimensional subspaces of an -dimensional vector space over a finite field of order ; two vertices are adjacent when their intersection is -dimensional. Many of the parameters of Grassmann graphs are -analogs of the parameters of Johnson graphs, and Grassmann graphs have several of the same graph properties as Johnson graphs.

In graph theory, Grassmann graphs are a special class of simple graphs defined from systems of subspaces. The vertices of the Grassmann graph are the -dimensional subspaces of an -dimensional vector space over a finite field of order ; two vertices are adjacent when their intersection is -dimensional. Many of the parameters of Grassmann graphs are -analogs of the parameters of Johnson graphs, and Grassmann graphs have several of the same graph properties as Johnson graphs. \omega \left( J_q(n,k) \right) = 1 - \frac{\lambda_{\max}}{\lambda_{\min}} In fact, unless n = 2k or k \in \{ 1, n - 1 \} , \operatorname{Aut}(J_q(n,k)) \cong \operatorname{P\Gamma L}(n, q) ; otherwise \operatorname{Aut}(J_q(n,k)) \cong \operatorname{P\Gamma L}(n, q) \times C_2 or \operatorname{Aut}(J_q(n,k)) \cong \operatorname{Sym}([n]_q) respectively. b_j := q^{2j + 1} [k - j]_q [n - k - j]_q for all 0 \leq j . c_j := ([j]_q)^2 for all 0 . \varphi(x) := \prod\limits_{j=0}^{\operatorname{diam}(J_q(n, k))} \left ( x - \left ( q^{j+1} [k - j]_q [n - k - j]_q - [j]_q \right ) \right )^{\left ( \binom{n}{j}_q - \binom{n}{j-1}_q \right )} .

See also

Grassmannian Johnson graph

Text derived from https://en.wikipedia.org/w/index.php?oldid=1301284437 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.