On the Main Signless Laplacian Eigenvalues of a Graph
Combinatorics
2012-08-30 v1
Abstract
A signless Laplacian eigenvalue of a graph is called a main signless Laplacian eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, we first give the necessary and sufficient conditions for a graph with one main signless Laplacian eigenvalue or two main signless Laplacian eigenvalues, and then characterize the trees and unicyclic graphs with exactly two main signless Laplacian eigenvalues, respectively.
Keywords
Cite
@article{arxiv.1208.5835,
title = {On the Main Signless Laplacian Eigenvalues of a Graph},
author = {Hanyuan Deng and He Huang},
journal= {arXiv preprint arXiv:1208.5835},
year = {2012}
}