Abstract
Symplectic totally isotropic subspace inclusion graph on a finite-dimensional symplectic space is a graph whose vertices are all totally isotropic subspaces of 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 are studied. Furthermore, a necessary and sufficient condition is provided for 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 is non-planar.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
