Spectral extremal results on the αα-index of graphs without minors and star forests

preprint2022arXivOpen access

Abstract

Let GG be a graph of order nn, and let A(G)A(G) and D(G)D(G) be the adjacency matrix and the degree matrix of GG respectively. Define the convex linear combinations Aα(G)A_α(G) of A(G)A (G) and D(G)D (G) by Aα(G)=αD(G)+(1−α)A(G)A_α(G)=αD(G)+(1-α)A(G) for any real number 0≤α≤10\leqα\leq1. The \emph{αα-index} of GG is the largest eigenvalue of Aα(G)A_α(G). In this paper, we determine the maximum αα-index and characterize all extremal graphs for KrK_r minor-free graphs, Ks,tK_{s,t} minor-free graphs, and star-forest-free graphs for any 0<α<10<α<1 by unified eigenvector approach, respectively.

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 reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.