On (2-d)-Kernels in Two Generalizations of the Petersen Graph
A subset J is a (2-d)-kernel of a graph if J is independent and 2-dominating simultaneously. In this paper, we consider two different generalizations of the Petersen graph and we give complete characterizations of these graphs which have (2-d)-kernel. Moreover, we determine the number of (2-d)-kernels of these graphs as well as their lower and upper kernel number. The property that each of the considered generalizations of the Petersen graph has a symmetric structure is useful in finding (2-d)-kernels in these graphs.
1994 ◽
Vol 34
(4)
◽
pp. 1044-1046
◽
Keyword(s):
1992 ◽
Vol 13
(4)
◽
pp. 279-290
◽
2016 ◽
Vol 231
(20)
◽
pp. 3855-3865
Keyword(s):
2013 ◽
Vol 579-580
◽
pp. 659-664
Keyword(s):