Strong (1, 1, 2)-Kernels in the Corona of Graphs and Some Realization Problems
Open Access
- 10 February 2020
- journal article
- research article
- Published by Springer Nature in Iranian Journal of Science and Technology, Transactions A: Science
- Vol. 44 (2) , 401-406
Abstract
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.Keywords
This publication has 9 references indexed in Scilit:
- On (2-d)-kernels in the cartesian product of graphsAnnales Universitatis Mariae Curie-Sklodowska, sectio A – Mathematica, 2016
- On the Number of k‐Dominating Independent SetsJournal of Graph Theory, 2016
- Total restrained domination in graphsComputers & Mathematics with Applications, 2011
- On kernels by monochromatic paths in the corona of digraphsOpen Mathematics, 2008
- On the existence and on the number of-kernels in the lexicographic product of graphsDiscrete Mathematics, 2008
- Monochromatic kernel-perfectness of special classes of digraphsDiscussiones Mathematicae Graph Theory, 2007
- On (k,l)-perfectnees of Special Classes of DigraphsDiscussiones Mathematicae Graph Theory, 2005
- Restrained domination in graphsDiscrete Mathematics, 1999
- Algorithms for Vertex Partitioning Problems on Partial k-TreesSIAM Journal on Discrete Mathematics, 1997