arXiv Analytics

Sign in

arXiv:2310.00251 [math.CO]AbstractReferencesReviewsResources

Direct sum graph of the subspaces of a finite dimensional vector space over finite fields

Bilal A. Wani, Aaqib Altaf, S. Pirzada, T. A. Chishti

Published 2023-09-30Version 1

In this paper, we introduce a new graph structure, called the $direct~ sum ~graph$ on a finite dimensional vector space. We investigate the connectivity, diameter and the completeness of $\Gamma_{U\oplus W}(\mathbb{V})$. Further, we find its domination number and independence number. We also determine the degree of each vertex in case the base field is finite and show that the graph $\Gamma_{U\oplus W}(\mathbb{V})$ is not Eulerian. We also show that under some mild conditions the graph $\Gamma_{U\oplus W}(\mathbb{V})$ is triangulated. We determine the clique number of $\Gamma_{U\oplus W}(\mathbb{V})$ for some particular cases. Finally, we find the size, girth, edge-connectivity and the chromatic number of $\Gamma_{U\oplus W}(\mathbb{V})$.

Related articles: Most relevant | Search more
arXiv:math/0606632 [math.CO] (Published 2006-06-25)
New upper bounds on the chromatic number of a graph
arXiv:1110.1756 [math.CO] (Published 2011-10-08)
About dependence of the number of edges and vertices in hypergraph clique with chromatic number 3
arXiv:1412.6349 [math.CO] (Published 2014-12-19)
The chromatic number of a signed graph