Tricyclic graphs with exactly two main eigenvalues
Mathematical Physics
2014-10-31 v2 Combinatorics
math.MP
Abstract
An eigenvalue of a graph is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. In this paper, all connected tricyclic graphs with exactly two main eigenvalues are determined.
Cite
@article{arxiv.math-ph/0309029,
title = {Tricyclic graphs with exactly two main eigenvalues},
author = {He Huang and Hanyuan Deng},
journal= {arXiv preprint arXiv:math-ph/0309029},
year = {2014}
}