Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size
From MaRDI portal
Publication:6657238
DOI10.1016/J.DAM.2024.10.025MaRDI QIDQ6657238FDOQ6657238
Publication date: 6 January 2025
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Spectra of graphs
- Connected hypergraphs with small spectral radius
- A note on the Randić spectral radius
- Degree-based energies of graphs
- On extremality of ABC spectral radius of a tree
- Trees with extremal spectral radius of weighted adjacency matrices among trees weighted by degree-based indices
- The smallest spectral radius of bicyclic uniform hypergraphs with a given size
- \((\alpha,\beta)\)-labelling method for \(k\)-uniform hypergraph and its applications
- The α-normal labelling method for computing the p-spectral radii of uniform hypergraphs
- Some interlacing results on weighted adjacency matrices of graphs with degree-based edge-weights
- Extremal trees and unicyclic graphs with respect to spectral radius of weighted adjacency matrices with property \(P^*\)
- The effect on the largest eigenvalue of degree-based weighted adjacency matrix by perturbations
- Unified approach for spectral properties of weighted adjacency matrices for graphs with degree-based edge-weights
- Some bounds on the largest eigenvalue of degree-based weighted adjacency matrix of a graph
- The maximum spectral radius of the weighted bicyclic hypergraphs
This page was built for publication: Extremal spectral radius of degree-based weighted adjacency matrices of graphs with given order and size
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6657238)