- Publication venue
- Publication date
- 20/11/2012
- Field of study
For two given positive integers p and q with p⩽q, we denote
\mathscr{T}_n^{p, 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
G1​≺s​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⩽p⩽q)
are characterized.Comment: 11 pages, 7 figure - Publication venue
- Schloss Dagstuhl - Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing
- Publication date
- 01/02/2018
- Field of study