✦ LIBER ✦

The group and the minimal polynomial of a graph

✍ Scribed by Giovanni Criscuolo; Chung-Mo Kwok; Abbe Mowshowitz; Roberto Tortora

Publisher: Elsevier Science
Year: 1980
Tongue: English
Weight: 636 KB
Volume: 29
Category: Article
ISSN: 0095-8956
DOI: 10.1016/0095-8956(80)90086-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

The characteristic polynomial of a graph

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

The minimal generating space of a polyno

The minimal generating space of a polynomial

✍ Pablo M. Salzberg 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 356 KB

The matching polynomial of a regular gra

The matching polynomial of a regular graph

✍ Robert A. Beezer; E.J. Farrell 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 588 KB

The matching polynomial of a graph has coefficients that give the number ofmatchings in the graph. For a regular graph, we show it is possible to recover the order, degree, girth and number of minimal cycles from the matching polynomial. If a graph is characterized by its matching polynomial, then i

On the group and the circuit group of a

On the group and the circuit group of a graph

✍ Steve Gallant 📂 Article 📅 1973 🏛 Elsevier Science 🌐 English ⚖ 205 KB

A relation between the group and the circuit group of a graph is given.

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