✦ LIBER ✦

A characteristic polynomial

✍ Scribed by Jon Rokne

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 137 KB
Volume: 5
Category: Article
ISSN: 0893-9659
DOI: 10.1016/0893-9659(92)90117-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The characteristic polynomial of a graph

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

Robust characteristic polynomial assignm

Robust characteristic polynomial assignment

✍ H. Rotstein; R. Sanchez Peña; J. Bandoni; A. Desages; J. Romagnoli 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 461 KB

Factoring the characteristic polynomial

✍ M. Randić; B. Baker; A. F. Kleiner 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 619 KB

Characteristic polynomial of catacondens

Characteristic polynomial of catacondensed systems

✍ Juan Rada 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 138 KB

The characteristic polynomial of a graph G is defined as det(xI -A), where I is the identity matrix and A is the adjacency matrix of G. Based on reduction procedures, we show that the characteristic polynomial of a catacondensed system can be obtained from a product of 5 × 5 matrices with integer co

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

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