✦ LIBER ✦

Characteristic polynomials of some graph coverings

✍ Scribed by Hirobumi Mizuno; Iwao Sato

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 209 KB
Volume: 142
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)00024-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Isomorphisms of some graph coverings

✍ Iwao Sato 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Let G be a connected graph and r a group of automorphisms of G. We enumerate the number of r-isomorphism classes of derived graph coverings of G with voltages in a finite field of prime order P (>2).

Method for construction of characteristi

Method for construction of characteristic polynomials via graph linearization

✍ Kakali Datta; Asok K. Mukherjee 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 1 views

A new method for construction of characteristic polynomials CP of complicated graphs having arbitrary edge and vertex weights has been developed. The method first converts the graph into isospectral linear chains with weighted vertices and edges and then builds up the CP coefficients recursively. Tw

The characteristic polynomial of a graph

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

Some characteristic property of the Meix

Some characteristic property of the Meixner polynomials

✍ Bruno Gabutti 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 464 KB

Some graphs with characteristic polynomi

Some graphs with characteristic polynomials which are not solvable by radicals

✍ C. D. Godsil 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 179 KB

## Abstract We show that “almost all” trees have characteristic polynomials which are not solvable by radicals.

Enumeration of connected graph coverings

✍ Kwak, Jin Ho; Lee, Jaeun 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 207 KB 👁 1 views

The number of the isomorphism classes of n-fold coverings of a graph G is enumerated by the authors (Canad.