On the Fibonacci numbers of the composition of graphs

DOI10.1016/j.dam.2019.02.047zbMath1464.05319OpenAlexW2926287579WikidataQ128093593 ScholiaQ128093593MaRDI QIDQ2026340

Loiret Alejandría Dosal-Trujillo, Hortensia Galeana-Sánchez

Publication date: 19 May 2021

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2019.02.047

zbMATH Keywords

independent setsindependence polynomialZykov sumFibonacci number of graphgraphs composition

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Independent vertex sets in the Zykov sum

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The Fibonacci numbers of certain subgraphs of circulant graphs
• Independence polynomials of some compound graphs
• On generalized Fibonacci numbers and \(k\)-distance \(K_p\)-matchings in graphs
• On the number of independent subsets in trees with restricted degrees
• On the location of roots of independence polynomials
• Generalized sequences and \(k\)-independent sets in graphs
• The number of independent sets of unicyclic graphs with given matching number
• On the existence and on the number of \((k,l)\)-kernels in the lexicographic product of graphs
• Fibonacci numbers and Lucas numbers in graphs
• Clique polynomials and independent set polynomials of graphs
• Graphs, partitions and Fibonacci numbers
• Bounds on the number of vertex independent sets in a graph
• The number of independent sets in unicyclic graphs

This page was built for publication: On the Fibonacci numbers of the composition of graphs