Abstract
Let G=(V,E) be a simple graph on vertex set V={v 1,v 2,⋯,v n}. Further let d i be the degree of v i and N i be the set of neighbors of v i. It is shown that max {d i+d j-|N i∩N j|:1i
Author supplied keywords
Cite
CITATION STYLE
APA
Das, K. C. (2003). An improved upper bound for Laplacian graph eigenvalues. Linear Algebra and Its Applications, 368, 269–278. https://doi.org/10.1016/S0024-3795(02)00687-0
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free