Pages that link to "Item:Q2568992"
From MaRDI portal
The following pages link to A sharp upper bound on the largest Laplacian eigenvalue of weighted graphs (Q2568992):
Displayed 15 items.
- On the bounds for the largest Laplacian eigenvalues of weighted graphs (Q448971) (← links)
- Extremal graph characterization from the bounds of the spectral radius of weighted graphs (Q535422) (← links)
- Lower bounds on the (Laplacian) spectral radius of weighted graphs (Q741488) (← links)
- A nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphs (Q861028) (← links)
- A sharp upper bound on the spectral radius of weighted graphs (Q932586) (← links)
- Bounds for the largest Laplacian eigenvalue of weighted graphs (Q1953663) (← links)
- Bounds on the spectral radii of digraphs in terms of walks (Q2344661) (← links)
- Extremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphs (Q2383016) (← links)
- On the signless Laplacian spectral radius of weighted digraphs (Q2419585) (← links)
- On the Laplacian spectral radius of weighted trees with fixed diameter and weight set (Q3082861) (← links)
- On the spectral radius of weighted unicyclic graphs with a positive weight set (Q3104567) (← links)
- The spectral radius of maximum weighted cycle (Q3178150) (← links)
- NEW BOUNDS AND EXTREMAL GRAPHS FOR DISTANCE SIGNLESS LAPLACIAN SPECTRAL RADIUS (Q4956583) (← links)
- A Unified Framework for Structured Graph Learning via Spectral Constraints (Q4969059) (← links)
- On the spectral radius of weighted trees with given number of pendant vertices and a positive weight set (Q5200331) (← links)