Fibonacci Identities and Graph Colorings

MaRDI QIDQ3181728zbMATH OpenFDO

Authors Christopher J. Hillar, Troels Windfeldt

Publication date 12 October 2009

Full work available at URL https://arxiv.org/abs/0805.0992

zbMATH Keywords

Fibonacci and Lucas numbersgraph coloringsidentitiesinteger recurrences

Mathematics Subject Classification ID

Combinatorial identities, bijective combinatorics (05A19) Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Abstract: We generalize both the Fibonacci and Lucas numbers to the context of graph colorings, and prove some identities involving these numbers. As a corollary we obtain new proofs of some known identities involving Fibonacci numbers such as [F_{r+s+t} = F_{r+1}F_{s+1}F_{t+1} + F_r F_s F_t - F_{r-1}F_{s-1}F_{t-1}.]

Recommendations

• Fibonacci numbers and identities
• Fibonacci graphs
• Some identities for the generalized Fibonacci numbers and the generalized Lucas numbers
• scientific article; zbMATH DE number 3873364
• Colored Partitions and the Fibonacci Sequence

Cited in

(5)

• Bivariate order polynomials
• scientific article; zbMATH DE number 4132181 (Why is no real title available?)
• A bivariate chromatic polynomial for signed graphs
• Colored Partitions and the Fibonacci Sequence
• Colourability of graphs representing the Lucas series modulo \(t\)

This page was built for publication: Fibonacci Identities and Graph Colorings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3181728)