The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights
From MaRDI portal
Cites work
- A note on the \(A_{\alpha}\)-spectral radius of graphs
- A spectral approach to the Randić index
- Asymptotic values of four Laplacian-type energies for matrices with degree-distance-based entries of random graphs
- Degree-based energies of graphs
- Extremal graphs for topological index defined by a degree-based edge-weight function
- Extremal problems for graphical function-indices and \(f\)-weighted adjacency matrix
- Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property P^*
- Extremal unicyclic graphs with respect to vertex-degree-based topological indices
- Geometric approach to degree-based topological indices: Sombor indices
- Graphs with minimum vertex-degree function-index for convex functions
- scientific article; zbMATH DE number 5280010 (Why is no real title available?)
- scientific article; zbMATH DE number 6125590 (Why is no real title available?)
- New upper bounds on the spectral radius of trees with the given number of vertices and maximum degree
- On spectral extrema of graphs with given order and dissociation number
- On spectral radius and energy of arithmetic-geometric matrix of graphs
- On the index of caterpillars
- On the Randi\'{c} index and conditional parameters of a graph
- On the spectral radius of graphs with cut vertices
- Ordering trees by their largest eigenvalues
- Ordering trees by their spectral radii
- Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph
- Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
- Spectral properties and energy of weighted adjacency matrices for graphs with degree-based edge-weight functions
- The ABC matrix
- The asymptotic value of energy for matrices with degree-distance-based entries of random graphs
- The asymptotic value of graph energy for random graphs with degree-based weights
- The effect on the Laplacian spectral radius of a graph by adding or grafting edges
- The effect on the largest eigenvalue of degree-based weighted adjacency matrix by perturbations
- The least eigenvalue of unicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- The minimum spectral radius of graphs with a given domination number
- The spectral radius of trees on \(k\) pendant vertices
- The spectral radius of unicyclic and bicyclic graphs with \(n\) vertices and \(k\) pendant vertices
- Towards a spectral theory of graphs based on the signless Laplacian. I
- Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
- Trees with maximum vertex-degree-based topological indices
- Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights
- Unimodality of principal eigenvector and its applications
This page was built for publication: The Li-Feng transformation of weighted adjacency matrices for graphs with degree-based edge-weights
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6973974)