Advances and Applications in Discrete Mathematics
Volume 23, Issue 2, Pages 75 - 83
(March 2020) http://dx.doi.org/10.17654/DM023020075 |
|
INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH
V. Jude Annie Cynthia and A. Kavitha
|
Abstract: A set D of vertices in a graph G, is a dominating set, if every vertex in is adjacent to atleast one vertex in D. A dominating set is called a minimum dominating set, if D consists of minimum number of vertices among all the dominating set. If contains dominating set of G, then is called an inverse dominating set. An inverse dominating set is called a minimum inverse dominating set, if consists of minimum number of vertices among all the inverse dominating set. The number of vertices in a minimum inverse dominating set is defined as inverse domination number of a graph G and it is denoted by In this paper we investigate the inverse domination number of circulant graph. |
Keywords and phrases: dominating set, inverse dominating set, inverse domination number, circulant graph.
|
|
Number of Downloads: 236 | Number of Views: 847 |
|