Lexicographical ordering by spectral moments of trees with a given bipartition

Document Type : Research Paper

Authors

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‎.

Keywords

Main Subjects


Volume 40, Issue 4 - Serial Number 4
August 2014
Pages 1027-1045
  • Receive Date: 11 January 2013
  • Revise Date: 16 July 2013
  • Accept Date: 21 July 2013
  • First Publish Date: 01 August 2014