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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.