No two starlikes have equal index

Published 5 Apr 2017 in math.CO | (1704.01663v2)

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.

Abstract PDF Upgrade to Chat

Authors (3)

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Paper Prompts

Sign up for free to create and run prompts on this paper using GPT-5.

Top Community Prompts

Explain it Like I'm 14

Practical Applications

Conceptual Simplification

Sign Up to Activate View All Prompts

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.