Fibonacci numbers in graphs with strong (1, 1, 2)-kernels
Open Access
- 23 February 2021
- journal article
- research article
- Published by Springer Nature in Boletín de la Sociedad Matemática Mexicana
- Vol. 27 (1) , 1-12
Abstract
In this paper, we study strong (1, 1, 2)-kernels in graphs which generalize classical kernels, (1, 2)-kernels and 2-dominating kernels, simultaneously. We give a complete characterization of trees with a strong (1, 1, 2)-kernel. Moreover, we present some realization theorems and show connections between the number of strong (1, 1, 2)-kernels and Fibonacci and Lucas numbers.Keywords
This publication has 10 references indexed in Scilit:
- On the existence and the number of independent (1,2)-dominating sets in the G-join of graphsApplied Mathematics and Computation, 2020
- Strong (1, 1, 2)-Kernels in the Corona of Graphs and Some Realization ProblemsIranian Journal of Science and Technology, Transactions A: Science, 2020
- Generalizing Erdős, Moon and Moser's result — The number of k-dominating independent setsElectronic Notes in Discrete Mathematics, 2017
- On the Number of k‐Dominating Independent SetsJournal of Graph Theory, 2016
- The Fibonacci numbers of certain subgraphs of circulant graphsAKCE International Journal of Graphs and Combinatorics, 2015
- On the existence of (k,l)-kernels in infinite digraphs: A surveyDiscussiones Mathematicae Graph Theory, 2014
- 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
- Theory of Games and Economic BehaviorReview of Economics and Statistics, 1947