Fibonacci numbers in graphs with strong (1, 1, 2)-kernels

DOI10.1007/s40590-021-00328-0zbMath1462.05155OpenAlexW3133057232MaRDI QIDQ2024063

Iwona Włoch, Urszula Bednarz

Publication date: 3 May 2021

Published in: Boletín de la Sociedad Matemática Mexicana. Third Series (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s40590-021-00328-0

zbMATH Keywords

independenceFibonacci numberskerneldomination

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• The Fibonacci numbers of certain subgraphs of circulant graphs
• Total graph interpretation of the numbers of the Fibonacci type
• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• Secondary domination in graphs
• Generalizing Erdős, Moon and Moser's result -- the number of \(k\)-dominating independent sets
• On the existence and the number of independent (1,2)-dominating sets in the \(G\)-join of graphs
• On the existence of \((k,l)\)-kernels in infinite digraphs: a survey
• On the Number ofk-Dominating Independent Sets
• Monochromatic kernel-perfectness of special classes of digraphs
• On (k,l)-perfectnees of Special Classes of Digraphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Fibonacci numbers in graphs with strong (1, 1, 2)-kernels