On Non-Zero Component Graph of Vector Spaces over Finite Fields
Abstract
In this paper, we study non-zero component graph (V) on a finite dimensional vector space V over a finite field F. We show that the graph is Hamiltonian and not Eulerian. We also characterize the maximal cliques in (V) and show that there exists two classes of maximal cliques in (V). We also find the exact clique number of (V) for some particular cases. Moreover, we provide some results on size, edge-connectivity and chromatic number of (V).
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.