Abstract
Let be a graph of order , and let and be the adjacency matrix and the degree matrix of respectively. Define the convex linear combinations of and by for any real number . The \emph{-index} of is the largest eigenvalue of . In this paper, we determine the maximum -index and characterize all extremal graphs for minor-free graphs, minor-free graphs, and star-forest-free graphs for any by unified eigenvector approach, respectively.
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.