✦ LIBER ✦

On the characteristic polynomial of a special class of graphs and spectra of balanced trees

✍ Scribed by Abbas Heydari; Bijan Taeri

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 262 KB
Volume: 429
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2008.05.016

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a Class of Polynomials and Its Relati

On a Class of Polynomials and Its Relation with the Spectra and Diameters of Graphs

✍ M.A. Fiol; E. Garriga; J.L.A. Yebra 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 602 KB

Let \* 1 >\* 2 > } } } >\* d be points on the real line. For every k=1, 2, ..., d, the k-alternating polynomial P k is the polynomial of degree k and norm Because of this optimality property, these polynomials may be thought of as the discrete version of the Chebychev polynomials T k and, for parti

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

Comments on the characteristic polynomia

Comments on the characteristic polynomial of a graph

✍ K. Balasubramanian 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 655 KB

Several unique advantages of the Le Verrier-Fadeev-Frame method for the characteristic polynomials of graphs over the method proposed by Zivkovic recently based on the Givens-Householder method are described. It is shown that the Givens-Householder method proposed by Zivkovic, by itself fails for di

Polynomial-time algorithms for solving a

Polynomial-time algorithms for solving a class of critical node problems on trees and series-parallel graphs

✍ Siqian Shen; J. Cole Smith 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

On Enumerating the Trees of the Wheel an

On Enumerating the Trees of the Wheel and Other Special Graphs

✍ David E. Johnson; Johnny R. Johnson 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 479 KB

A specialized method is presented for listing all the spanning trees of the wheel, homeomorphs of the wheel, and certain cellular arrays. The procedure is a generalization of a known method of enumerating the trees of a suitably labeled ladder graph, and results in a direct listing of the trees with

On the computation of characteristic pol

On the computation of characteristic polynomial of a chemical graph

✍ P. Křivka; Ž. Jeričević; N. Trinajstić 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 637 KB