An always nontrivial upper bound for Laplacian graph eigenvalues

From MaRDI portal
Publication:1573668

DOI10.1016/S0024-3795(00)00104-XzbMath0958.05088MaRDI QIDQ1573668

Oscar Rojo, Héctor Rojo, Ricardo L. Soto

Publication date: 30 March 2001

Published in: Linear Algebra and its Applications (Search for Journal in Brave)




Related Items (33)

On the Laplacian Eigenvalues of Signed GraphsExtremal graph characterization from the upper bound of the Laplacian spectral radius of weighted graphsLaplacian Spectra and Synchronization Processes on Complex NetworksLaplacian spectral bounds for clique and independence numbers of graphsUpper bounds on algebraic connectivity via convex optimizationLower bounds of the Laplacian spectrum of graphs based on diameterA nontrivial upper bound on the largest Laplacian eigenvalue of weighted graphsSome properties of ergodicity coefficients with applications in spectral graph theoryAn improved upper bound for Laplacian graph eigenvaluesOn the Laplacian spectral radius of a tree.Proof of conjectures involving algebraic connectivity of graphsOn the Laplacian spectral radius of a graphA characterization on graphs which achieve the upper bound for the largest Laplacian eigenvalue of graphs.Two sharp upper bounds for the Laplacian eigenvalues.Unnamed ItemA decreasing sequence of upper bounds on the largest Laplacian eigenvalue of a graph.On the spectral radius of graphsSeveral sharp upper bounds for the largest Laplacian eigenvalue of a graphOn upper bounds for Laplacian graph eigenvaluesBounds on the index of the signless Laplacian of a graphLargest eigenvalue of a unicyclic mixed graphsBounds of Laplacian spectrum of graphs based on the domination numberA new upper bound for the Laplacian spectral radius of graphsCharacterization on graphs which achieve a Das' upper bound for Laplacian spectral radiusThe (signless) Laplacian spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant verticesLower bounds on the (Laplacian) spectral radius of weighted graphsOn the controllability of Corona product networkThe case of equality in the Dobrushin-Deutsch-Zenger boundAn improved upper bound for the Laplacian spectral radius of graphsA sharp upper bound on the largest Laplacian eigenvalue of weighted graphsBounds for the Laplacian spectral radius of graphsThe Laplacian eigenvalues of mixed graphsA bound on the Laplacian spread which is tight for strongly regular graphs



Cites Work


This page was built for publication: An always nontrivial upper bound for Laplacian graph eigenvalues