The -spectral radius of trees with perfect matchings
From MaRDI portal
(Redirected from Publication:6671391)
The \(\varepsilon\)-spectral radius of trees with perfect matchings
The \(\varepsilon\)-spectral radius of trees with perfect matchings
Recommendations
- On the spectral radius and the energy of eccentricity matrices of graphs
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
- On the largest and least eigenvalues of eccentricity matrix of trees
- Eccentricity spectral radius of t-clique trees with given diameter
Cites work
- \(D_{\max}\) -- matrix of dominant distances in a graph
- Characterizing the extremal graphs with respect to the eccentricity spectral radius, and beyond
- Extensions of rational modules.
- Graph theory
- scientific article; zbMATH DE number 193132 (Why is no real title available?)
- scientific article; zbMATH DE number 6282149 (Why is no real title available?)
- On the largest and least eigenvalues of eccentricity matrix of trees
- Skew-rank of an oriented graph in terms of matching number
- Solutions for two conjectures on the eigenvalues of the eccentricity matrix, and beyond
- The anti-adjacency matrix of a graph: eccentricity matrix
This page was built for publication: The \(\varepsilon\)-spectral radius of trees with perfect matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6671391)