✦ LIBER ✦

Computing the characteristic polynomial of a tree

✍ Scribed by G. Tinhofer; H. Schreck

Publisher: Springer Vienna
Year: 1985
Tongue: English
Weight: 544 KB
Volume: 35
Category: Article
ISSN: 0010-485X
DOI: 10.1007/bf02260499

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing the characteristic polynomial

Computing the characteristic polynomial of a tree

✍ Bojan Mohar 📂 Article 📅 1989 🏛 Springer 🌐 English ⚖ 170 KB

Method for computing the characteristic

Method for computing the characteristic polynomial

✍ Ivailo M. Mladenov; Marin D. Kotarov; Julia G. Vassileva-Popova 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB

## Abstract A new algorithm for calculating characteristic coefficients is proposed.

Combinatorial approach for computing the

Combinatorial approach for computing the characteristic polynomial of a matrix

✍ Francesco Belardo; Enzo M. Li Marzi; Slobodan K. Simić 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 227 KB

On the characteristic and Laplacian poly

On the characteristic and Laplacian polynomials of trees

✍ Abbas Heydari; Bijan Taeri 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 232 KB

We find the characteristic polynomials of adjacency and Laplacian matrices of arbitrary unweighted rooted trees in term of vertex degrees, using the concept of the rooted product of graphs. Our result generalizes a result of Rojo and Soto [O. Rojo, R. Soto, The spectra of the adjacency matrix and La

A graphical evaluation of characteristic

A graphical evaluation of characteristic polynomials of huckel trees

✍ Yuan-Sun Kiang(Y.Jiang); Au-Chin Tang 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 454 KB

The characteristic polynomial of a graph

✍ Abbe Mowshowitz 📂 Article 📅 1972 🏛 Elsevier Science 🌐 English ⚖ 839 KB