✦ LIBER ✦

The characteristic polynomial of a graph

✍ Scribed by Abbe Mowshowitz

Publisher: Elsevier Science
Year: 1972
Tongue: English
Weight: 839 KB
Volume: 12
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(72)90023-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

On the evaluation of the characteristic

On the evaluation of the characteristic polynomial of a chemical graph

✍ Tomislav P. Živković 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 583 KB

## Abstract The evaluation of the characteristic polynomial of a chemical graph is considered. It is shown that the operation count of the Le Verrier–Faddeev–Frame method, which is presently considered to be the most efficient method for the calculation of the characteristic polynomial, is of the o

A solution to Gutman's problem on the ch

A solution to Gutman's problem on the characteristic polynomial of a bipartite graph

✍ Xueliang Li; Heping Zhang 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 209 KB

In this short paper, we present a solution to Gutman's problem on the characteristic polynomial of a bipartite graph (Research Problem 134, Discrete Math. 88 (1991)). In [2] I. Gutman proposed a research problem which is stated as follows. The matchings polynomial of a graph G is defined by cl(G,x)

Characteristic polynomials of some graph

Characteristic polynomials of some graph coverings

✍ Hirobumi Mizuno; Iwao Sato 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 209 KB

The Wiener polynomial of a graph

✍ Bruce E. Sagan; Yeong-Nan Yeh; Ping Zhang 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 674 KB

The Wiener index is a graphical invariant that has found extensive application in chemistry. We define a generating function, which we call the Wiener polynomial, whose derivative is a q-analog of the Wiener index. We study some of the elementary properties of this polynomial and compute it for some

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