Spectral Radii of Arithmetical Structures on Cycle Graphs

Abstract: Let

G

be a finite, connected graph. An arithmetical structure on

G

is a pair of positive integer-valued vectors

(m a t h b f d, m a t h b f r)

such that

(e x t d i a g (m a t h b f d) - A_{G}) c d o t m a t h b f r = e x t b f 0,

where the entries of

m a t h b f r

have

g c d

1 and

A_{G}

is the adjacency matrix of

G

. In this article we find the arithmetical structures that maximize and minimize the spectral radius of

(e x t d i a g (m a t h b f d) - A_{G})

among all arithmetical structures on the cycle graph

m a t h c a l C_{n} .

This page was built for publication: Spectral Radii of Arithmetical Structures on Cycle Graphs