paper

Tricyclic graphs with exactly two main eigenvalues

arXiv:1012.0963

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.

16 pages, 4 figures

Cited by in corpus (1)