Displaying similar documents to “Tight estimates for eigenvalues of regular graphs.”

On the distance spectrum of a cycle

Ante Graovac, Gani Jashari, Mate Strunje (1985)

Aplikace matematiky

Similarity:

Analytic expressions for the roots of the distance polynomial of a cycle are given.

Tricyclic graphs with exactly two main eigenvalues

Xiaoxia Fan, Yanfeng Luo, Xing Gao (2013)

Open Mathematics

Similarity:

An eigenvalue of a graph G is called a main eigenvalue if it has an eigenvector the sum of whose entries is not equal to zero. Let G 0 be the graph obtained from G by deleting all pendant vertices and δ(G) the minimum degree of vertices of G. In this paper, all connected tricyclic graphs G with δ(G 0) ≥ 2 and exactly two main eigenvalues are determined.