Direct sum graph of the subspaces of a finite dimensional vector space over finite fields
Abstract
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 U W(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 U W(V) is not Eulerian. We also show that under some mild conditions the graph U W(V) is triangulated. We determine the clique number of U W(V) for some particular cases. Finally, we find the size, girth, edge-connectivity and the chromatic number of U W(V).
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.