Faculty of Mathematics and Statistics, Central China Normal University
Abstract
Lexicographic ordering by spectral moments ($S$-order) among all trees is discussed in this
paper. For two given positive integers $p$ and $q$ with $p\leqslant q$, we denote $\mathscr{T}_n^{p, q}=\{T: T$ is a tree of order $n$ with a $(p, q)$-bipartition\}. Furthermore, the last four trees, in the $S$-order, among $\mathscr{T}_n^{p, q}\,(4\leqslant p\leqslant q)$ are characterized.
L i, S., & Zhang, J. (2014). Lexicographical ordering by spectral moments of trees with a given bipartition. Bulletin of the Iranian Mathematical Society, 40(4), 1027-1045.
MLA
S. L i; J. Zhang. "Lexicographical ordering by spectral moments of trees with a given bipartition". Bulletin of the Iranian Mathematical Society, 40, 4, 2014, 1027-1045.
HARVARD
L i, S., Zhang, J. (2014). 'Lexicographical ordering by spectral moments of trees with a given bipartition', Bulletin of the Iranian Mathematical Society, 40(4), pp. 1027-1045.
VANCOUVER
L i, S., Zhang, J. Lexicographical ordering by spectral moments of trees with a given bipartition. Bulletin of the Iranian Mathematical Society, 2014; 40(4): 1027-1045.
)