No two starlikes have equal index

Abstract

The index of a graph is the largest eigenvalue of its adjacency matrix. A starlike is a tree having a unique vertex of degree $r>2$. We show how to order the starlike trees with $n>3$ by their indices. In particular, the indices of starlike trees are all distinct.

Cited by in corpus (1)

• Applications of rational difference equations to spectral graph theory: expanded version