Paper Info
Title
Domination Number Of Unit Graph Of Z(N)
Abstract
The unit graph of a ring R is the simple graph, denoted by G(R), whose vertex set is R, and in which two distinct vertices x and y are adjacent if and only if x + y is a unit of R. In this paper, we completely determine the domination number of G(Z(n)) when n has exactly three prime divisors.
Year
DOI
Venue
2020
10.1142/S1793830920500597
DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS
Keywords
DocType
Volume
Unit graph, dominating set, domination number
Journal
12
Issue
ISSN
Citations 
5
1793-8309
0
PageRank 
References 
Authors
0.34
0
2
Name
Order
Citations
PageRank
Huadong Su100.34
Liying Yang2117.05