Strong (1, 1, 2)-Kernels in the Corona of Graphs and Some Realization Problems

被引：0
作者：
Urszula Bednarz
机构：
[1] Rzeszow University of Technology,Department of Discrete Mathematics, Faculty of Mathematics and Applied Physics
来源：
Iranian Journal of Science and Technology, Transactions A: Science | 2020年 / 44卷
关键词：
Domination; Independence; Kernel; Corona; 05C20; 05C69;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
In this paper, we give the necessary and sufficient conditions for the existence of strong (1, 1, 2)-kernels in the corona of graphs. Moreover, we consider lower and upper strong (1, 1, 2)-kernel numbers and we prove that the difference between these parameters can be arbitrarily large.
引用
收藏
页码：401 / 406
页数：5
相关论文
共 32 条
  • [1] Bednarz P(2016)On (2-d)-kernels in the cartesian product of graphs Ann UMCS Sect A 70 1-8
  • [2] Włoch I(2017)An algorithm determining (2-d)-kernels in trees Util Math 102 215-222
  • [3] Bednarz P(2015)On the existence and number of (2-d)-kernels in graphs Ars Comb 121 341-351
  • [4] Włoch I(2011)Total restrained domination in graphs Comput Math Appl 62 2892-2898
  • [5] Bednarz P(1999)Restrained domination in graphs Discrete Math 203 61-69
  • [6] Hernandez-Cruz C(2007)Monochromatic kernel-perfectness of special classes of digraphs Discuss Math Graph Theory 27 389-400
  • [7] Włoch I(2011)-kernels in the Ars Comb 99 353-377
  • [8] Chen X(2008)-join AKCE J Graphs Comb. 5 103-115
  • [9] Liu J(2005)Secondary domination in graphs Discuss Math Graph Theory 25 103-119
  • [10] Meng J(2016)On J Graph Theory 84 566-580
1234