Fibonacci numbers and Lucas numbers in graphs

DOI10.1016/j.dam.2008.08.028zbMath1179.05085MaRDI QIDQ1028490

Iwona Włoch, Mariusz Startek, Andrezej Włoch

Publication date: 30 June 2009

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

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

zbMATH Keywords

counting; Fibonacci numbers; Lucas numbers; number of independent sets

Mathematics Subject Classification ID

05A15: Exact enumeration problems, generating functions

05C69: Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.)

Related Items

The Fibonacci numbers of certain subgraphs of circulant graphs, Ordering polygonal chains with respect to Hosoya index, On the number of independent subsets in trees with restricted degrees, Maxima and minima of the Hosoya index and the Merrifield-Simmons index, The adjacency matrix of one type of directed graph and the Jacobsthal numbers and their determinantal representation, On types of distance Fibonacci numbers generated by number decompositions, On a generalization for Fibonacci quaternions, On the connectivity properties and energy of Fibonomial graphs, A Class of Convergent Series with Golden Ratio Based on Fibonacci Sequence

Cites Work

• The Merrifield - Simmons indices and Hosoya indices of trees with \(k\) pendant vertices
• Trees with extremal numbers of maximal independent sets including the set of leaves
• Bounds on the number of vertex independent sets in a graph
• The number of independent sets in unicyclic graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item