Properties of the Fibonacci-sum graph

Publication date: 27 October 2017

Abstract: For each positive integer

n

, the Fibonacci-sum graph

G_{n}

on vertices

1, 2, l d o t s, n

is defined by two vertices forming an edge if and only if they sum to a Fibonacci number. It is known that each

G_{n}

is bipartite, and all Hamiltonian paths in each

G_{n}

have been classified. In this paper, it is shown that each

G_{n}

has at most one non-trivial automorphism, which is given explicitly. Other properties of

G_{n}

are also found, including the degree sequence, the treewidth, the nature of the bipartition, and that

G_{n}

is outerplanar.

This page was built for publication: Properties of the Fibonacci-sum graph