No two starlikes have equal index
Combinatorics
2020-08-05 v2
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 . We show how to order the starlike trees with by their indices. In particular, the indices of starlike trees are all distinct.
Keywords
Cite
@article{arxiv.1704.01663,
title = {No two starlikes have equal index},
author = {Elismar R. Oliveira and Dragan Stevanović and Vilmar Trevisan},
journal= {arXiv preprint arXiv:1704.01663},
year = {2020}
}