Lexicographical ordering by spectral moments of trees with a prescribed diameter

被引：20

作者：

Wu, Yaping ^{[2
]}

Liu, Huiqing ^{[1
]}

机构：

[1] Hubei Univ, Sch Math & Comp Sci, Wuhan 430062, Peoples R China

[2] Jianghan Univ, Sch Math & Comp Sci, Wuhan 430056, Peoples R China

来源：

LINEAR ALGEBRA AND ITS APPLICATIONS | 2010年 / 433卷 / 11-12期

关键词：

Tree; Diameter; Spectral moment; GRAPHS;

D O I：

10.1016/j.laa.2010.06.022

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Let T-n,T-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,T-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,T-d (4 <= d <= n - 3) are characterized. Moreover, all trees in T-n,T-d have an S-order for d <= 3 and d >= n - 2. Crown Copyright (C) 2010 Published by Elsevier Inc. All rights reserved.

引用

页码：1707 / 1713

页数：7