A recursion exists among the coefficients of the color polynomials of some of the families of graphs considered in recent work of Balasubramanian and Ramaraj. Such families of graphs have been called Fibonacci graphs. Application to king patterns of lattices is given. The method described here applies only to the so called Fibonacci graphs.
展开▼
