English

Automorphisms of the subspace sum graphs on a vector space

Combinatorics 2017-04-13 v1

Abstract

The subspace sum graph G(V)\mathcal{G}(\mathbb{V}) on a finite dimensional vector space V\mathbb{V} was introduced by Das [Subspace Sum Graph of a Vector Space, arXiv:1702.08245], recently. The vertex set of G(V)\mathcal{G}(\mathbb{V}) consists of all the nontrivial proper subspaces of V\mathbb{V} and two distinct vertices W1W_1 and W2W_2 are adjacent if and only if W1+W2=VW_1+W_2=\mathbb{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)\mathcal{G}(\mathbb{V}) was left as one of further research topics. Motivated by this, we in this paper characterize the automorphisms of G(V)\mathcal{G}(\mathbb{V}) completely.

Keywords

Cite

@article{arxiv.1704.03787,
  title  = {Automorphisms of the subspace sum graphs on a vector space},
  author = {Fenglei Tian and Dein Wong},
  journal= {arXiv preprint arXiv:1704.03787},
  year   = {2017}
}
R2 v1 2026-06-22T19:15:44.743Z