Bounds for the largest and the smallest A_ eigenvalues of a graph in terms of vertex degrees
From MaRDI portal
Publication:2174489
Recommendations
Cites work
- 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)\)
- Eigenvalues of the Laplacian of a graph∗
- Graphs determined by their \(A_\alpha\)-spectra
- Merging the \(A\)- and \(Q\)-spectral theories
- On the \(\alpha\)-index of graphs with pendent paths
- On the \(A_\alpha\)-spectra of graphs
- On the \(A_\alpha\)-spectral radius of a graph
- On the \(A_{\alpha}\)-spectra of trees
- On the multiplicity of as an A_()-eigenvalue of signed graphs with pendant vertices
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the α-spectral radius of graphs
- Spectra of graphs
- The \(A_{\alpha}\) spectral radius characterization of some digraphs
- The clique number and the smallest \(Q\)-eigenvalue of graphs
- The smallest eigenvalue of the signless Laplacian
Cited in
(25)- Some spectral inequalities for connected bipartite graphs with maximum \(A_\alpha\)-index
- An arithmetic criterion for graphs being determined by their generalized \(A_\alpha \)-spectra
- On the \(A_\sigma\)-spectral radii of graphs with some given parameters
- The \(A_\alpha\)-spread of a graph
- On the Aα-spectral radius of connected graphs
- Bounds on the \(A_\alpha\)-spectral radius of a \(C_3\)-free graph
- On the smallest eigenvalue of \({A_\alpha}(G)\)-matrix
- A_ and L_-spectral properties of spider graphs
- Some bounds on the Aα-index of connected graphs with fixed order and size
- On the smallest eigenvalue of Dα-matrix of connected graphs
- Ordering graphs by their largest (least) Aα-eigenvalues
- scientific article; zbMATH DE number 7690926 (Why is no real title available?)
- On the characteristic polynomial of the \(A_\alpha\)-matrix for some operations of graphs
- Bounds for Aα-eigenvalues
- Aα-spectrum of duplicate and corona operations in graphs
- Sharp bounds on the \(A_{\alpha}\)-index of graphs in terms of the independence number
- Bounds for degree-sum adjacency eigenvalues of a graph in terms of Zagreb indices
- Some results involving the \(A_\alpha\)-eigenvalues for graphs and line graphs
- On the A_-index of graphs with given order and dissociation number
- Ordering graphs with fixed size and girth by their \(A_{\alpha}\)-spectral radius
- On the -index of minimally k-(edge-)connected graphs for small k
- A connection between the A_-spectrum and Lovász theta number
- Bounds for the incidence \(\mathcal{Q}\)-spectral radius of uniform hypergraphs
- On the A_ spectral radius and A_ energy of non-strongly connected digraphs
- The A_ spectral radius of graphs with given independence number n-4
This page was built for publication: Bounds for the largest and the smallest \(A_\alpha\) eigenvalues of a graph in terms of vertex degrees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2174489)