Automorphisms of the subspace sum graphs on a vector space

Abstract

The subspace sum graph G(V) on a finite dimensional vector space V was introduced by Das [Subspace Sum Graph of a Vector Space, arXiv:1702.08245], recently. The vertex set of G(V) consists of all the nontrivial proper subspaces of V and two distinct vertices W1 and W2 are adjacent if and only if W1+W2=V. In that paper, some structural indices (e.g., diameter, girth, connectivity, domination number, clique number and chromatic number) were studied, but the characterization of automorphisms of G(V) was left as one of further research topics. Motivated by this, we in this paper characterize the automorphisms of G(V) completely.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…