Title
Invariants Of Fibonacci Graphs
Keywords
Fibonacci graphs; Invariants
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.
Publication Date
2-1-2008
Publication Title
Journal of Combinatorial Mathematics and Combinatorial Computing
Volume
64
Number of Pages
273-285
Document Type
Article
Personal Identifier
scopus
Copyright Status
Unknown
Socpus ID
78651555106 (Scopus)
Source API URL
https://api.elsevier.com/content/abstract/scopus_id/78651555106
STARS Citation
Anderson, Mark; Barrientos, Christian; Brigham, Robert C.; Carrington, Julie R.; and Vitray, Richard P., "Invariants Of Fibonacci Graphs" (2008). Scopus Export 2000s. 10714.
https://stars.library.ucf.edu/scopus2000/10714