English

Bicyclic graphs with exactly two main signless Laplacian eigenvalues

Combinatorics 2013-10-10 v2

Abstract

A signless Laplacian eigenvalue of a graph GG 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, all connected bicyclic graphs with exactly two main eigenvalues are determined.

Keywords

Cite

@article{arxiv.1201.0050,
  title  = {Bicyclic graphs with exactly two main signless Laplacian eigenvalues},
  author = {He Huang and Hanyuan Deng},
  journal= {arXiv preprint arXiv:1201.0050},
  year   = {2013}
}
R2 v1 2026-06-21T19:58:24.172Z