✦ LIBER ✦

Ordering of the trees with a perfect matching by minimal energies

✍ Scribed by Wen-Huan Wang; Li-Ying Kang

Publisher: Elsevier Science
Year: 2009
Tongue: English
Weight: 276 KB
Volume: 431
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2009.03.053

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Ordering of trees with fixed matching nu

Ordering of trees with fixed matching number by the Laplacian coefficients

✍ Shushan He; Shuchao Li 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 448 KB

On the th Laplacian eigenvalues of trees

On the th Laplacian eigenvalues of trees with perfect matchings

✍ Jianxi Li; Wai Chee Shiu; An Chang 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 132 KB

Bounds on the second largest eigenvalue

Bounds on the second largest eigenvalue of a tree with perfect matchings

✍ Chang An 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 487 KB

A note on the second largest eigenvalue

A note on the second largest eigenvalue of a tree with perfect matchings

✍ Ji-Ming Guo; Shang-Wang Tan 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 201 KB

New theorem for the wiener molecular bra

New theorem for the wiener molecular branching index of trees with perfect matchings

✍ I. Gutman; D.H. Rouvray 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 347 KB

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