Tricyclic graphs with exactly two main eigenvalues
Combinatorics
2010-12-07 v1 Spectral Theory
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.1012.0963,
title = {Tricyclic graphs with exactly two main eigenvalues},
author = {Xiaoxia Fan and Yanfeng Luo},
journal= {arXiv preprint arXiv:1012.0963},
year = {2010}
}
Comments
16 pages, 4 figures