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

DOI10.1007/S10255-023-1049-4MaRDI QIDQ6173979zbMATH OpenOpenAlexFDO

Authors Wanting Sun, Lixia Yan, Shuchao Li, Xuechao Li

Publication date 13 July 2023

Published in Acta Mathematicae Applicatae Sinica. English Series (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2204.08301

zbMATH Keywords

spectral radiusbipartite graphindependence number\(A_{\alpha}\)-index

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Abstract: Given a graph $G$, the adjacency matrix and degree diagonal matrix of $G$ are denoted by $A(G)$ and $D(G)$, respectively. In 2017, Nikiforov cite{0007} proposed the $A_{alpha}$-matrix: $A_{alpha}(G)=alphaD(G)+(1-alpha)A(G),$ where $alphain[0,1]$. The largest eigenvalue of this novel matrix is called the $A_{a}lpha$-index of $G$. In this paper, we characterize the graphs with minimum $A_{a}lpha$-index among $n$-vertex graphs with independence number $i$ for $alphain[0,1)$, where $i=1,lfloorfracn2floor,lceilfracn2ceil,lfloorfracn2floor+1,n-3,n-2,n-1,$ whereas for $i=2$ we consider the same problem for $alphain[0,frac34].$ Furthermore, we determine the unique graph (resp. tree) on $n$ vertices with given independence number having the maximum $A_{a}lpha$-index with $alphain[0,1)$, whereas for the $n$-vertex bipartite graphs with given independence number, we characterize the unique graph having the maximum $A_{a}lpha$-index with $alphain[frac12,1).$

Recommendations

• Some bounds on the A_α-index of connected graphs with fixed order and size
• Graphs of fixed order and size with maximal \(A_\alpha\)-index
• Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
• Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case
• On the eigenvalues of \(A_\alpha \)-matrix of graphs

Cites work

• scientific article; zbMATH DE number 5280010 (Why is no real title available?)
• scientific article; zbMATH DE number 7166393 (Why is no real title available?)
• A characterization of the smallest eigenvalue of a graph
• A note on the \(A_{\alpha}\)-spectral radius of graphs
• A note on the positive semidefiniteness of \(A_{\alpha}(G)\)
• An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
• Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
• Bounds on graph eigenvalues. II
• Bounds on the \(A_{\alpha}\)-spread of a graph
• Connected graphs of fixed order and size with maximal \(Q\)-index: some spectral bounds
• Connected graphs of fixed order and size with maximal index: some spectral bounds
• Graphs whose \(A_\alpha \) -spectral radius does not exceed 2
• Maximizing spectral radius of unoriented Laplacian matrix over bicyclic graphs of a given order
• Merging the \(A\)- and \(Q\)-spectral theories
• On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
• On the \(A_\alpha\)-spectral radius of a graph
• On the \(A_{\alpha}\)-spectra of trees
• On the \(\alpha\)-index of graphs with pendent paths
• On the multiplicity of \(\alpha\) as an eigenvalue of the \(a_\alpha\) matrix of a graph in terms of the number of pendant vertices
• On the second largest \(A_{\alpha}\)-eigenvalues of graphs
• On the spectral radius of graphs with cut vertices
• On the spectral radius of trees with given independence number
• On the spectrum of an equitable quotient matrix and its application
• Some bounds on the A_α-index of connected graphs with fixed order and size
• Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
• Spectra of graphs
• Spectral radii of graphs with given chromatic number
• Spectral radius of graphs with given matching number
• The Nordhaus-Gaddum type inequalities of \(A_\alpha \)-matrix
• The \(A_\alpha \)-spectral radius of trees and unicyclic graphs with given degree sequence
• The effect on A_α-eigenvalues of mixed graphs and unit gain graphs by adding edges in clusters
• The maximal \(\alpha\)-index of trees with \(k\) pendent vertices and its computation
• The minimal spectral radius of graphs with a given diameter
• The minimum signless Laplacian spectral radius of graphs with given independence number
• The minimum spectral radius of graphs with a given independence number
• The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
• The signless Laplacian spectral radius of graphs with given chromatic number
• The signless Laplacian spectral radius of graphs with given number of pendant vertices

Cited in

(7)

• Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
• Graphs of fixed order and size with maximal \(A_\alpha\)-index
• The extremal \(\alpha \)-index of graphs with no 4-cycle and 5-cycle
• Some bounds on the A_α-index of connected graphs with fixed order and size
• Maxima of the \(A_\alpha\)-index of graphs with given size and domination number
• On the \(A_\alpha\)-index of graphs with given order and dissociation number
• Connected graphs of fixed order and size with maximal \(A_\alpha \)-index: the one-dominating-vertex case

This page was built for publication: Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6173979)