Contents

-

Invariants of Fibonacci Graphs

Mark Anderson1, Christian Barrientos2, Robert. C. Brigham3, Julie R. Carrington1, Richard P. Vitray1, Jay Yellen1
1Departanent. of Mathematical Sciences, Rollins College, Winter Park, PL 32789
2Department of Mathematics, Clayton State University, Morrow, GA 30260
3Department of Mathematics, University of Central Florida, Orlando, FL 32816

Abstract

The Fibonacci graph Gn 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.

Keywords: Fibonacci graphs, invariants AMS Classification: 05C75