Bounds for the Laplacian spectral radius of graphs
From MaRDI portal
Publication:5006624
DOI10.5614/ejgta.2017.5.2.10zbMath1467.05162OpenAlexW2766574581MaRDI QIDQ5006624
Binod Kumar Sahoo, Kamal Lochan Patra
Publication date: 16 August 2021
Published in: Electronic Journal of Graph Theory and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.5614/ejgta.2017.5.2.10
Related Items
Tarantula graphs are determined by their Laplacian spectrum, On the spectra of token graphs of cycles and other graphs, On the Ky Fan $k$-norm of the $LI$-matrix of graphs, A unique and novel graph matrix for efficient extraction of structural information of networks, The second least eigenvalue of the signless Laplacian of the complements of trees, On distance signless Laplacian spectrum and energy of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bounds of Laplacian spectrum of graphs based on the domination number
- Improved upper bounds for the Laplacian spectral radius of a graph
- The Laplacian spectrum of a mixed graph
- Lower bounds of the Laplacian spectrum of graphs based on diameter
- Bounds on graph eigenvalues. I
- Bounds on the (Laplacian) spectral radius of graphs
- Sharp upper and lower bounds for the Laplacian spectral radius and the spectral radius of graphs
- On upper bounds for Laplacian graph eigenvalues
- A note on sum of powers of the Laplacian eigenvalues of bipartite graphs
- An improved upper bound for the Laplacian spectral radius of graphs
- A note on Laplacian graph eigenvalues
- On the Laplacian eigenvalues of a graph
- Laplacian matrices of graphs: A survey
- A new upper bound for eigenvalues of the Laplacian matrix of a graph
- An improved upper bound for Laplacian graph eigenvalues
- On the Laplacian spectral radius of a tree.
- On the Laplacian spectral radius of a graph
- A characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.
- Two sharp upper bounds for the Laplacian eigenvalues.
- On the spectral radius of graphs
- Bounds for sums of eigenvalues and applications
- An always nontrivial upper bound for Laplacian graph eigenvalues
- An upper bound on the sum of squares of degrees in a graph
- A sharp upper bound on the largest eigenvalue of the Laplacian matrix of a graph
- A new upper bound for the Laplacian spectral radius of graphs
- Characterization on graphs which achieve a Das' upper bound for Laplacian spectral radius
- Upper bound for the Laplacian graph eigenvalues
- Expanding and forwarding
- Sharp lower bounds on the Laplacian eigenvalues of trees
- On the two conjectures of Graffiti
- Sharp upper bounds for the Laplacian graph eigenvalues
- Bounding the largest eigenvalue of trees in terms of the largest vertex degree
- The Laplacian eigenvalues of mixed graphs
- Several sharp upper bounds for the largest Laplacian eigenvalue of a graph
- Improved bounds for the largest eigenvalue of trees
- Sharp upper and lower bounds for largest eigenvalue of the Laplacian matrices of trees
- Sums of powers of the degrees of a graph
- Laplacian spectral bounds for clique and independence numbers of graphs
- The Laplacian spectral radius of graphs
- A new upper bound for the Laplacian spectral radius of a graph
- The Laplacian Spectrum of a Graph
- Remarks on Spectral Radius and Laplacian Eigenvalues of a Graph
- Eigenvalues of the Laplacian of a graph∗
- The Laplacian Spectrum of a Graph II
- The largest two Laplacian eigenvalues of a graph
- A survey of graph laplacians
- de Caen's inequality and bounds on the largest Laplacian eigenvalue of a graph
- On the \(k\)th largest eigenvalue of the Laplacian matrix of a graph
