On the spectral moment of graphs with k cut edges

2012/09/12 by Li, Shuchao, Zhang, Huihui · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics

paper · doi:10.48550/arxiv.1209.2528

Abstract

Let A(G) be the adjacency matrix of a graph G with λ₁(G), λ₂(G), ..., λ_n(G) being its eigenvalues in non-increasing order. Call the number S_k(G):=∑_i=1ⁿλ_i^k(G) (k=0,1,...,n-1) the kth spectral moment of G. Let S(G)=(S₀(G),S₁(G),...,S_n-1(G)) be the sequence of spectral moments of G. For two graphs G₁ and G₂, we have G₁\prec_sG₂ if S_i(G₁)=S_i(G₂) (i=0,1,...,k-1) and S_k(G₁)

Cited by

• Lexicographical ordering by spectral moments of bicyclic hypergraphs

Related

• On the spectral moment of trees with given degree sequences
• On the spectral moments of trees with a given bipartition
• Spectral moments of trees with given degree sequence
• Moment-Based Spectral Analysis of Random Graphs with Given Expected Degrees
• On the spectral moment of graphs with given clique number