𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Ordering trees with algebraic connectivity and diameter

✍ Scribed by Xiao-Dong Zhang

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
186 KB
Volume
427
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

The ordering of trees and connected grap
The ordering of trees and connected graphs by algebraic connectivity
✍ Jia-Yu Shao; Ji-Ming Guo; Hai-Ying Shan πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 235 KB

In this paper, we first determine that the first four trees of order n 9 with the smallest algebraic connectivity are P n , Q n , W n and Z n with Ξ±(P n ) < Ξ±(Q n ) < Ξ±(W n ) < Ξ±(Z n ) < Ξ±(T ), where T is any tree of order n other than P n , Q n , W n , and Z n . Then we consider the effect on the L

Lexicographical ordering by spectral mom
Lexicographical ordering by spectral moments of trees with a prescribed diameter
✍ Yaping Wu; Huiqing Liu πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 206 KB

Let T n,d be the class of trees with n vertices and diameter d. In this paper, the lexicographic ordering of trees in the set T n,d (3 d n -2) by spectral moments is considered, and the last d 2 + 1 trees, in an S-order, among all trees in T n,d (4 d n -3) are characterized. Moreover, all trees in T