Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
1709180 | Applied Mathematics Letters | 2012 | 4 Pages |
Abstract
Lexicographic ordering by spectral moments (S-order) among all trees is discussed in this paper. For integers n and k, let p(n,k) be the number of all partitions of n into k parts. The last p(nâ1,k) graphs, in the S-order, among all trees with n vertices and k pendant vertices are determined for 2
Keywords
Related Topics
Physical Sciences and Engineering
Engineering
Computational Mechanics
Authors
Bo Cheng, Bolian Liu,