Automorphism group of the subspace inclusion graph of a vector space

2017/04/19 by Dein Wong, Wong, Dein, Xinlei Wang +3
Materials Science · Mathematics · #Combinatorics (math.CO) #FOS: Mathematics #Finite Group Theory Research #Rings, Modules, and Algebras #Synthesis and properties of polymers

paper · pdf · doi:10.48550/arxiv.1704.05673

openalex publication_date 2017/04/19 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28

Abstract

In a recent paper [Comm. Algebra, 44(2016) 4724-4731], Das introduced the graph In(\mathbbV), called subspace inclusion graph on a finite dimensional vector space \mathbbV, where the vertex set is the collection of nontrivial proper subspaces of \mathbbV and two vertices are adjacent if one is properly contained in another. Das studied the diameter, girth, clique number, and chromatic number of In(\mathbbV) when the base field is arbitrary, and he also studied some other properties of In(\mathbbV) when the base field is finite. In this paper, the automorphisms of In(\mathbbV) are determined when the base field is finite.

Related

• Automorphisms of the subspace sum graphs on a vector space
• The spectrum and automorphism group of the set-inclusion graph
• Automorphism related parameters of a graph associated to a finite vector space
• Graph Automorphisms from the Geometric Viewpoint
• Automorphism groups of graphs