Pages that link to "Item:Q2570118"
From MaRDI portal
The following pages link to An eigenvalue bound for the Laplacian of a graph (Q2570118):
Displaying 16 items.
- Bounds on normalized Laplacian eigenvalues of graphs (Q260423) (← links)
- Partial characterization of graphs having a single large Laplacian eigenvalue (Q668039) (← links)
- Proof of a conjecture on `plateaux' phenomenon of graph Laplacian eigenvalues (Q739109) (← links)
- Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods (Q1297416) (← links)
- A new upper bound for eigenvalues of the Laplacian matrix of a graph (Q1369347) (← links)
- A decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph. (Q1430375) (← links)
- Tight estimates for eigenvalues of regular graphs (Q1883695) (← links)
- Bounds on the negative eigenvalues of Laplacians on finite metric graphs (Q2391796) (← links)
- The normalized distance Laplacian (Q2663695) (← links)
- Correction to: ``Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme''. A remark on normalized Laplacian eigenvalues of signed graph (Q2688823) (← links)
- Eigenvalue Comparison Theorems of Neumann Laplacian for Graphs. (Q4943490) (← links)
- LAPLACIAN EIGENVALUES OF GRAPHS WITH GIVEN DOMINATION NUMBER (Q5324146) (← links)
- Eigenvalue bounds for some classes of matrices associated with graphs (Q5858489) (← links)
- Restructured class of estimators for population mean using an auxiliary variable under simple random sampling scheme (Q5925625) (← links)
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph (Q5935566) (← links)
- A new method to compute the determinantal polynomial coefficients of a matrix (symmetric normalized Kirchhoff matrix) of a complete graph (Q6671118) (← links)
