A relation between the Laplacian and signless Laplacian eigenvalues of a graph

14Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Let G be a graph of order n such that ∑ni=0(-1) iailambdan-i and ∑ni=0(-1) iailambdan-i are the characteristic polynomials of the signless Laplacian and the Laplacian matrices of G, respectively. We show that a i ≥b i for i=0,1,⋯,n. As a consequence, we prove that for any α, 0

Cite

CITATION STYLE

APA

Akbari, S., Ghorbani, E., Koolen, J. H., & Oboudi, M. R. (2010). A relation between the Laplacian and signless Laplacian eigenvalues of a graph. Journal of Algebraic Combinatorics, 32(3), 459–464. https://doi.org/10.1007/s10801-010-0225-9

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free