Automorphism group of the subspace inclusion graph of a vector space

Abstract

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…