✦ LIBER ✦

Isomorphisms of some graph coverings

✍ Scribed by Iwao Sato

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 555 KB
Volume: 128
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(94)90122-8

No coin nor oath required. For personal study only.

✦ Synopsis

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).

📜 SIMILAR VOLUMES

Isomorphisms and automorphisms of graph

Isomorphisms and automorphisms of graph coverings

✍ M. Hofmeister 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 503 KB

Characteristic polynomials of some graph

Characteristic polynomials of some graph coverings

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

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.

Zeta Functions of Graph Coverings

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

We give a decomposition formula for the zeta function of a group covering of a graph.

Regular graph coverings whose covering t

Regular graph coverings whose covering transformation groups have the isomorphism extension property

✍ Sungpyo Hong; Jin Ho Kwak; Jaeun Lee 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 870 KB

Enumerative results are presently a major center of interest in topological graph theory, as in the work of Gross and Furst [1], Hofmeister [5,6], and Mull et al. [15], etc. Kwak and Lee [9] enumerated the isomorphism classes of graph bundles and those of n-fold graph coverings with respect to a gr

On some subclasses of well-covered graph

On some subclasses of well-covered graphs

✍ Jo Ann W. Staples 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 367 KB 👁 1 views

A set of points in a graph is independent if no two points in the set are adjacent. A graph is well covered if every maximal independent set is a maximum independent set or, equivalently, if every independent set is contained in a maximum independent set. The well-covered graphs are classified by th