Comparing Fullerenes by Spectral Moments.

Abstract

Suppose G is a graph, A(G) its adjacency matrix, and μ1(G)≤(G)μ2(G)≤ ... ≤ μ(n)(G)are eigenvalues of A(G). The numbers S(k)(G) = Σ(i) n = 1 μ(i)k (G), 0 ≤ k ≤ n -1 are said to be the k-th spectral moment of G and the sequence S(G) = (S0(G), S1 (G),..., S(n-1)(G)is called the spectral moments sequence of G. Suppose G1 and G2 are graphs. If there exists an integer k, 1 ≤ k ≤ n - 1, such that for each i, 0 ≤ i ≤ k - 1, S(i) (G1) = S(i)(G2) and S(k)(G1) < S(k)(G2) then we write G1 -<(s) G2. The aim of this paper is order some classes of fullerene graphs with respect to the S-order.