INVERSE DOMINATION NUMBER OF CIRCULANT GRAPH

2020 ◽  
Vol 23 (2) ◽  
pp. 75-83
Author(s):  
V. Jude Annie Cynthia ◽  
A. Kavitha
2020 ◽  
Vol 12 (04) ◽  
pp. 2050055
Author(s):  
Yen-Jen Cheng ◽  
Hung-Lin Fu ◽  
Chia-An Liu

Let [Formula: see text] be a simple undirected graph. [Formula: see text] is a circulant graph defined on [Formula: see text] with difference set [Formula: see text] provided two vertices [Formula: see text] and [Formula: see text] in [Formula: see text] are adjacent if and only if [Formula: see text]. For convenience, we use [Formula: see text] to denote such a circulant graph. A function [Formula: see text] is an integer [Formula: see text]-domination function if for each [Formula: see text], [Formula: see text] By considering all [Formula: see text]-domination functions [Formula: see text], the minimum value of [Formula: see text] is the [Formula: see text]-domination number of [Formula: see text], denoted by [Formula: see text]. In this paper, we prove that if [Formula: see text], [Formula: see text], then the integer [Formula: see text]-domination number of [Formula: see text] is [Formula: see text].


Author(s):  
K. Uma Samundesvari ◽  
J. Maria Regila Baby
Keyword(s):  

In this paper the author have found out the medium domination number of Helm graph, Friendship graph.


2017 ◽  
Vol 7 (1) ◽  
pp. 109
Author(s):  
S. K. Vaidya ◽  
Sejal Hiteshbhai Karkar
Keyword(s):  

Author(s):  
S. Balamurugan ◽  
G. Prabakaran
Keyword(s):  

2019 ◽  
Vol 10 (4) ◽  
pp. 865-876
Author(s):  
S. Sarah Surya ◽  
Fathima Sana Afrin. S
Keyword(s):  

2020 ◽  
Vol 9 (5) ◽  
pp. 2895-2902
Author(s):  
S. Basheer Ahamed ◽  
M. Mohamed Riyazdeen ◽  
M. Magudeskumar

Sign in / Sign up

Export Citation Format

Share Document