๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Lexicographical ordering by spectral moments of trees with a prescribed diameter

โœ Scribed by Yaping Wu; Huiqing Liu

Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
206 KB
Volume
433
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

โœฆ Synopsis

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 n,d have an S-order for d 3 and d n -2.

๐Ÿ“œ SIMILAR VOLUMES

Covering the Edges of a Graph by a Presc
Covering the Edges of a Graph by a Prescribed Tree with Minimum Overlap
โœ Noga Alon; Yair Caro; Raphael Yuster ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 360 KB

Let H=(V H , E H ) be a graph, and let k be a positive integer. A graph G=(V G , E G ) is H-coverable with overlap k if there is a covering of the edges of G by copies of H such that no edge of G is covered more than k times. Denote by overlap(H, G) the minimum k for which G is H-coverable with over