Abstract
In this paper, we continue the study of the subspace inclusion graph on a finite-dimensional vector space with dimension n where the vertex set is the collection of non-trivial proper subspaces of a vector space and two vertices are adjacent if one is contained in other. It is shown that is perfect and non-planar. Moreover, a necessary and sufficient condition is provided for to be Eulerian. For , it is shown that is bipartite, vertex and edge-transitive and has a perfect matching. We also provide exact value of the independence number and bounds on the domination number of for .
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.
