✦ LIBER ✦

The spectra of the adjacency matrix and Laplacian matrix for some balanced trees

✍ Scribed by Oscar Rojo; Ricardo Soto

Publisher: Elsevier Science
Year: 2005
Tongue: English
Weight: 282 KB
Volume: 403
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2005.01.011

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Permanent of the Laplacian matrix of tre

Permanent of the Laplacian matrix of trees and bipartite graphs

✍ Richard A Brualdi; John L Goldwasser 📂 Article 📅 1984 🏛 Elsevier Science 🌐 English ⚖ 805 KB

be the Laplacian matrix of G. When G is a tree or a bipartite graph we obtain bounds for the permanent of L(G) both in terms of n only and in terms of d 1 ..... d,. Improved bounds are obtained in terms of the diameter of T and the size of a matching in T.

Permanent of the laplacian matrix of tre

Permanent of the laplacian matrix of trees with a given matching

✍ John L Goldwasser 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 715 KB

We define the Laplacian ratio of a tree z(T), to be the permanent of the Laplacian matrix of T divided by the product of the degrees of the vertices. Best possible lower and upper bounds are obtained for ~r(T) in terms of the size of the largest matching in T.

Some determinant expansions and the matr

Some determinant expansions and the matrix-tree theorem

✍ J.W. Moon 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 513 KB

We derive an expansion for a certain determinant that involves two sets of formal variables. The result provides a unified approach to several known expansions including a generalized form of the matrix-tree theorem.

Bounding the diameter and the mean dista

Bounding the diameter and the mean distance of a graph from its eigenvalues: Laplacian versus adjacency matrix methods

✍ J.A. Rodríguez; J.L.A. Yebra 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 527 KB

Recently, several results bounding above the diameter and/or the mean distance of a graph from its eigenvalues have been presented. They use the eigenvalues of either the adjacency or the Laplacian matrix of the graph. The main object of this paper is to compare both methods. As expected, they are e

A bound for the permanent of the Laplaci

A bound for the permanent of the Laplacian matrix

✍ R.B. Bapat 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 296 KB

On the determinant of the adjacency matr

On the determinant of the adjacency matrix for a planar sublattice

✍ P.A Deift; C Tomei 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 510 KB