✦ LIBER ✦

The spectral moments of trees with given maximum degree

✍ Scribed by Xiang-Feng Pan; Xiaolan Hu; Xiuguo Liu; Huiqing Liu

Book ID: 108052647
Publisher: Elsevier Science
Year: 2011
Tongue: English
Weight: 236 KB
Volume: 24
Category: Article
ISSN: 0893-9659
DOI: 10.1016/j.aml.2011.02.022

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Laplacian spectral radius of trees with

Laplacian spectral radius of trees with given maximum degree

✍ Aimei Yu; Mei Lu 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 140 KB

On the variable Wiener indices of trees

On the variable Wiener indices of trees with given maximum degree

✍ Muhuo Liu; Bolian Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 509 KB

Largest Number of Subtrees of Trees with

Largest Number of Subtrees of Trees with a Given Maximum Degree

✍ Kirk, Russell; Wang, Hua 📂 Article 📅 2008 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 190 KB

On the Wiener polarity index of trees wi

On the Wiener polarity index of trees with maximum degree or given number of leaves

✍ Bolian Liu; Huoquan Hou; Yufei Huang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 272 KB

On the largest tree of given maximum deg

On the largest tree of given maximum degree in a connected graph

✍ Y. Caro; I. Krasikov; Y. Roditty 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract We prove that every connected graph __G__ contains a tree __T__ of maximum degree at most __k__ that either spans __G__ or has order at least __k__δ(__G__) + 1, where δ(__G__) is the minimum degree of __G.__ This generalizes and unifies earlier results of Bermond [1] and Win [7]. We als

The Number of Subtrees of Trees with Giv

The Number of Subtrees of Trees with Given Degree Sequence

✍ Xiu-Mei Zhang; Xiao-Dong Zhang; Daniel Gray; Hua Wang 📂 Article 📅 2012 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB