2016
DOI: 10.1080/03081087.2016.1234577
|View full text |Cite
|
Sign up to set email alerts
|

Non-zero component union graph of a finite-dimensional vector space

Abstract: In this paper, we introduce a graph structure, called non-zero component graph on finite dimensional vector spaces. We show that the graph is connected and find its domination number and independence number. We also study the inter-relationship between vector space isomorphisms and graph isomorphisms and it is shown that two graphs are isomorphic if and only if the corresponding vector spaces are so. Finally, we determine the degree of each vertex in case the base field is finite.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
39
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
9

Relationship

2
7

Authors

Journals

citations
Cited by 41 publications
(39 citation statements)
references
References 14 publications
0
39
0
Order By: Relevance
“…Firstly, we recall the definition of Non-zero Component graph of a finite dimensional vector space and some preliminary results from [9].…”
Section: Definitions and Some Basic Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…Firstly, we recall the definition of Non-zero Component graph of a finite dimensional vector space and some preliminary results from [9].…”
Section: Definitions and Some Basic Resultsmentioning
confidence: 99%
“…Theorem 3.4. [9] Let V be a vector space over a finite field F with q elements and Γ be its associated graph with respect to a basis {α 1 , α 2 , . .…”
Section: Definitions and Some Basic Resultsmentioning
confidence: 99%
“…their exists at least one α i along which both v 1 and v 2 have non-zero components. Unless otherwise mention, we take the basis α α α … { , , , } n 1 2 on which the graph is constructed (Das, 2016). Now, we state some basic results about Γ( ) , which will be useful in the sequel.…”
Section: Graph Associated To a Vector Spacementioning
confidence: 99%
“…This new technique of studying algebraic structures leads to many fascinating results and questions. For various constructions of graphs on different algebras we refer to [2,7] on rings, [3,5] on groups, [6] on semigroups, [23,24,26,33] on posets, [9,10,11,12] on vector spaces.…”
Section: Introductionmentioning
confidence: 99%