Menu
The Fibonacci graph \( G_n \) is the graph whose vertex set is the collection of \( n \)-bit binary strings having no contiguous ones, and two vertices are adjacent if and only if their Hamming distance is one. Values of several graphical invariants are determined for these graphs, and bounds are found for other invariants.