English

Fibonacci Identities and Graph Colorings

Combinatorics 2008-07-09 v2 General Mathematics

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 Fr+s+t=Fr+1Fs+1Ft+1+FrFsFtFr1Fs1Ft1.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}.

Keywords

Cite

@article{arxiv.0805.0992,
  title  = {Fibonacci Identities and Graph Colorings},
  author = {Christopher J. Hillar and Troels Windfeldt},
  journal= {arXiv preprint arXiv:0805.0992},
  year   = {2008}
}

Comments

5 pages, 1 figure

R2 v1 2026-06-21T10:38:16.514Z