Abstract
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.
Subject
Physics and Astronomy (miscellaneous),General Mathematics,Chemistry (miscellaneous),Computer Science (miscellaneous)
Reference36 articles.
1. Graph Theory;Diestel,2005
2. Theory of Games and Economic Behavior;Morgenstern,1944
3. Graphs and Hypergraphs;Berge,1973
4. Perfect graphs and kernels;Berge;Bull. Inst. Math. Acad. Sin.,1988
5. Recent problems and results about kernels in directed graphs
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献