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

Socpus ID

78651555106 (Scopus)

Source API URL

https://api.elsevier.com/content/abstract/scopus_id/78651555106

This document is currently not available here.

Share

COinS