Sharp bounds on the AαA_α-index of graphs in terms of the independence number

preprint2022arXivOpen access

Abstract

Given a graph GG, the adjacency matrix and degree diagonal matrix of GG are denoted by A(G)A(G) and D(G)D(G), respectively. In 2017, Nikiforov \cite{0007} proposed the AαA_α-matrix: Aα(G)=αD(G)+(1−α)A(G),A_α(G)=αD(G)+(1-α)A(G), where α∈[0,1]α\in [0, 1]. The largest eigenvalue of this novel matrix is called the AαA_α-index of GG. In this paper, we characterize the graphs with minimum AαA_α-index among nn-vertex graphs with independence number ii for α∈[0,1)α\in[0,1), where i=1,⌊n2⌋,⌈n2⌉,⌊n2⌋+1,n−3,n−2,n−1,i=1,\lfloor\frac{n}{2}\rfloor,\lceil\frac{n}{2}\rceil,{\lfloor\frac{n}{2}\rfloor+1},n-3,n-2,n-1, whereas for i=2i=2 we consider the same problem for α∈[0,34].α\in [0,\frac{3}{4}{]}. Furthermore, we determine the unique graph (resp. tree) on nn vertices with given independence number having the maximum AαA_α-index with α∈[0,1)α\in[0,1), whereas for the nn-vertex bipartite graphs with given independence number, we characterize the unique graph having the maximum AαA_α-index with α∈[12,1).α\in[\frac{1}{2},1).

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.