✦ LIBER ✦

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

✍ Scribed by Ji-Ming Guo; Shang-Wang Tan

Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 201 KB
Volume: 380
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2003.06.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The second largest eigenvalue of a tree

✍ A. Neumaier 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 981 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

The Kth largest eigenvalue of a tree

✍ Hong Yuan 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 214 KB

A note on the number of perfect matching

A note on the number of perfect matchings of bipartite graphs

✍ Zhang Fuji; Zhang Heping 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 484 KB

Let G be a bipartite graph with 2n vertices, A its adjacency matrix and K the number of perfect matchings. For plane bipartite graphs each interior face of which is surrounded by a circuit of length 4s + 2, s E { 1,2,. . .}, an elegant formula, i.e. det A = (-1 )nK2, had been rigorously proved by Cv

A note on the kth eigenvalue of trees

✍ Ji-Ming Guo 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 103 KB