The multiplicity of A_-eigenvalues of graphs
From MaRDI portal
Publication:5124691
Recommendations
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- On the \(A_\alpha\)-spectra of graphs
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the eigenvalues of \(A_\alpha \)-matrix of graphs
- Some spectral properties of \(A_\alpha\)-matrix
Cites work
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- A note on the positive semidefiniteness of \(A_{\alpha}(G)\)
- Bipartite distance-regular graphs with an eigenvalue of multiplicity \(k\)
- Distance spectral radius of trees with fixed maximum degree
- Eigenvalue multiplicities of highly symmetric graphs
- Eigenvalue multiplicity in cubic graphs
- Eigenvalue multiplicity in triangle-free graphs
- Graph theory
- Graphs determined by their \(A_\alpha\)-spectra
- scientific article; zbMATH DE number 3445271 (Why is no real title available?)
- Laplacian-like energy of trees
- 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}\)-characteristic polynomial of a graph
- On the \(A_{\alpha}\)-spectra of trees
- On the largest eigenvalues of trees with perfect matchings
- On the minimal energy of trees with a given diameter
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- On the nullity and the matching number of unicyclic graphs
- On the nullity of bipartite graphs
- On the nullity of bipartite graphs
- On the nullity of graphs
- On the nullity of line graphs of trees
- On triangle-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- Permanent of the Laplacian matrix of trees and bipartite graphs
- Spectra of graphs
- Triangle- and pentagon-free distance-regular graphs with an eigenvalue multiplicity equal to the valency
- Triangle-free distance-regular graphs with an eigenvalue multiplicity equal to their valency and diameter 3
Cited in
(13)- Multiplicities of eigenvalues and tree-width of graphs
- On the multiplicity of \(\alpha\) as an eigenvalue of \(A_\alpha(G)\) of graphs with pendant vertices
- A bound for the \(p\)-domination number of a graph in terms of its eigenvalue multiplicities
- On the multiplicity of an arbitrary \(A_\alpha\)-eigenvalue of a connected graph
- The multiplicity of an \(A_\alpha \)-eigenvalue: a unified approach for mixed graphs and complex unit gain graphs
- On the eigenvalues of \(A_\alpha \)-matrix of graphs
- On the multiplicity of \(\alpha\) as an eigenvalue of the \(a_\alpha\) matrix of a graph in terms of the number of pendant vertices
- Topological multiplicity of the maximum eigenvalue of graph \(1\)-Laplacian
- Some consequences of an inequality on the spectral multiplicity of graphs
- The characterization of graphs with eigenvalue -1 of multiplicity n-4 or n-5
- \(A_{\alpha}\)-spectral extrema of graphs with given size and matching number
- About the type of broom trees
- Ordering of graphs with fixed size and diameter by A α -spectral radii
This page was built for publication: The multiplicity of \(A_{\alpha}\)-eigenvalues of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5124691)