On the spectral moments of trees with a given bipartition

Abstract

For two given positive integers p and q with p≤slant q, we denote Tnp, q=T: T is a tree of order n with a (p, q)-bipartition. For a graph G with n vertices, let A(G) be its adjacency matrix with eigenvalues λ1(G), λ2(G), ..., λn(G) in non-increasing order. The number Sk(G):=Σi=1nλik(G)\,(k=0, 1, ..., n-1) is called the kth spectral moment of G. Let S(G)=(S0(G), S1(G),..., Sn-1(G)) be the sequence of spectral moments of G. For two graphs G1 and G2, one has G1s G2 if for some k∈ 1,2,...,n-1, Si(G1)=Si(G2) (i=0,1,...,k-1) and Sk(G1)<Sk(G2) holds. In this paper, the last four trees, in the S-order, among Tnp, q (4≤slant p≤slant q) are characterized.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…