Let G be a connected undirected graph with n vertices and m edges, and let μ1≥μ2≥…≥μn−1>μn=0 be Laplacian eigenvalues of adjacency matrix of G. In this paper a generalization of some inequalities for the Laplacian spreads LS(G)=μ1−μn−1, LR+(G)=μ1μn−1+μn−1μ1 and LR−(G)=μ1μn−1−μn−1μ1 is presented.
Linear Algebra and its Applications – Elsevier
Published: Aug 15, 2016
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud