Abstract
Symplectic totally isotropic subspace inclusion graph In(S) on a finite-dimensional symplectic space S is a graph whose vertices are all totally isotropic subspaces of S and two distinct vertices are adjacent if and only if one is contained in other. In this paper, the diameter, girth, clique number, chromatic number of In(S) are studied. Furthermore, a necessary and sufficient condition is provided for In(S) to be Eulerian. It is shown that if two symplectic totally isotropic subspace inclusion graphs on symplectic space are isomorphic, then the two subspace inclusion graphs on corresponding vector space are also isomorphic. It is also shown that In(S) is non-planar.
Funding Information
  • Natural Science Foundation of Hebei Province (A2022205024)
  • Hebei Province Graduate Innovation Fund Project (CXZZBS2023084)

This publication has 10 references indexed in Scilit: