Subspace Sum Graph of a Vector Space

Publication date 27 February 2017

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Abstract: In this paper we introduce a graph structure, called subspace sum graph

m a t h c a l G (m a t h b b V)

on a finite dimensional vector space

m a t h b b V

where the vertex set is the collection of non-trivial proper subspaces of a vector space and two vertices

W_{1}, W_{2}

are adjacent if

W_{1} + W_{2} = m a t h b b V

. The diameter, girth, connectivity, maximal independent sets, different variants of domination number, clique number and chromatic number of

m a t h c a l G (m a t h b b V)

are studied. It is shown that two subspace sum graphs are isomorphic if and only if the base vector spaces are isomorphic. Finally some properties of subspace sum graph are studied when the base field is finite.

This page was built for publication: Subspace Sum Graph of a Vector Space

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283668)