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.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.