A generalization of dual polar graph of orthogonal space (Q1046465)
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: A generalization of dual polar graph of orthogonal space |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A generalization of dual polar graph of orthogonal space |
scientific article |
Statements
A generalization of dual polar graph of orthogonal space (English)
0 references
22 December 2009
0 references
The authors discuss the generalizations of dual polar graphs of affine-orthogonal spaces. Let \(\delta= 0,1\) or \(2\), and let \(AOG(2\nu+ \delta,\mathbb{F}_q)\) be the \((2\nu+ \delta)\)-dimensional affine-orthogonal space over finite field \(\mathbb{F}_q\). Define a graph \(\Gamma^\delta\) whose vertex-set is the set of all maximal isotropic flats of \(AOG(2\nu+ \delta, \mathbb{F}_q)\), and in which \(F_1\), \(F_2\) are adjacent if and only if \(\dim(F_1\cup F_2)= \nu+ 1\), for any \(F_1,F_2\in \Gamma^\delta\). The authors study the graph \(\Gamma^\delta\). The paper is organized as follows. In Section 2, they recall some of concepts and results about the affine-orthogonal space and dual polar graph. In Section 3, they study the distance function of the graph \(\Gamma^\delta\) and the size of \(\Gamma^\delta_r(F)\). In Section 4, they discuss the maximal cliques of \(\Gamma^\delta\). In Section 5, they study the connectivity of some subgraphs of \(\Gamma^\delta\). First they show that the distance between any two vertices in \(\Gamma^\delta\) is determined by means of dimension of their join and prove that \(\Gamma^\delta\) is a vertex transitive graph with diameter \(\nu+ [(1+\delta)/2]\) and valency \((q^{\nu+\delta}-1)+ q^{1+ \delta}{\nu\brack 1}_q\). Next, they show that any maximal clique in \(\Gamma^\delta\) is isomorphic to the maximal clique \(\Omega^\delta_1\) \((\delta\geq 1)\) with size \(q^\delta+ 1\), the maximal clique \(\Omega^\delta_2\) with size \(2q\), or the maximal clique \(\Omega^\delta_3\) with size \(q^{\nu+\delta}\) and also compute the total number of maximal clique in \(\Gamma^\delta\). Finally, they study the connectivity of some subgraphs of \(\Gamma^\delta\).
0 references
affine-orthogonal space
0 references
dual polar graph
0 references
maximal totally isotropic flat
0 references