Abstract
The subspace inclusion graph on a vector space [Formula: see text], denoted by [Formula: see text], is a graph whose vertex set consists of nontrivial proper subspaces of [Formula: see text] and two vertices are adjacent if one is properly contained in another. In a recent paper, Das posed the following four conjectures on the subspace inclusion graph [Formula: see text]: If [Formula: see text] is a [Formula: see text]-dimensional vector space over a finite field [Formula: see text] with [Formula: see text] elements, then: (1) The domination number of [Formula: see text] is [Formula: see text]. (2) [Formula: see text] is distance regular. (3) [Formula: see text] is Hamiltonian. (4) [Formula: see text] is a Cayley graph. In the present paper, we prove the first two conjectures: If [Formula: see text] is a [Formula: see text]-dimensional vector space over a finite field [Formula: see text] with [Formula: see text] elements, then: (1) The domination number of [Formula: see text] is [Formula: see text]. (2) [Formula: see text] is distance regular.
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.
