✦ LIBER ✦

The characteristic polynomial and the matchings polynomial of a weighted oriented graph

✍ Scribed by Shi-Cai Gong; Guang-Hui Xu

Book ID: 113772231
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 275 KB
Volume: 436
Category: Article
ISSN: 0024-3795
DOI: 10.1016/j.laa.2011.12.033

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational algorithms for matching po

Computational algorithms for matching polynomials of graphs from the characteristic polynomials of edge-weighted graphs

✍ Haruo Hosoya; K. Balasubramanian 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 736 KB

Computational algorithms are described which provide for constructing the set of associated edgeweighted directed graphs such that the average of the characteristic polynomials of the edge-weighted graphs gives the matching polynomial of the parent graph. The weights were chosen to be unities or pur

The characteristic polynomial of a graph

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

The characteristic polynomial of a chemi

The characteristic polynomial of a chemical graph

✍ Nenad Trinajstić 📂 Article 📅 1988 🏛 Springer 🌐 English ⚖ 995 KB

Characteristic and matching polynomials

Characteristic and matching polynomials of chemical graphs

✍ W.C. Herndon; T.P. Radhakrishnan; T.P. Zivkovic 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 476 KB

Evaluation of the characteristic polynom

Evaluation of the characteristic polynomial of a graph

✍ Tomislav P Z̆ivković 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 387 KB

Two algorithms for the evaluation of the characteristic polynomial of a graph G are described. Both algorithms have the operation count of the order n3, where n is the number of the vertices in the graph G. These algorithms are stable, fast, and efficient. They are one order of magnitude faster tha

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