✦ LIBER ✦

Counting double covers of graphs

✍ Scribed by M. Hofmeister

Publisher: John Wiley and Sons
Year: 1988
Tongue: English
Weight: 288 KB
Volume: 12
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190120316

No coin nor oath required. For personal study only.

✦ Synopsis

Any group of automorphisms of a graph G induces a notion of isomorphism between double covers of G. The corresponding isomorphism classes will be counted.

📜 SIMILAR VOLUMES

Five Cycle Double Covers of Some Cubic G

Five Cycle Double Covers of Some Cubic Graphs

✍ A. Huck; M. Kochol 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Distance-Regular Graphs withbt=1 and Ant

Distance-Regular Graphs withbt=1 and Antipodal Double-Covers

✍ Makoto Araya; Akira Hiraki; Aleksandar Jurišić 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 239 KB

Let 1 be a distance-regular graph of diameter d and valency k>2. If b t =1 and 2t d, then 1 is an antipodal double-cover. Consequently, if f >2 is the multiplicity of an eigenvalue of the adjacency matrix of 1 and if 1 is not an antipodal doublecover then d 2f&3. This result is an improvement of God

Minimum cycle covers of graphs

✍ Fan, Genghua 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 145 KB 👁 1 views

Some new results on minimum cycle covers are proved. As a consequence, it is obtained that the edges of a bridgeless graph G can be covered by cycles of total length at most |E(G)| + 25 24 (|V (G)| -1), and at most |E(G)| + |V (G)| -1 if G contains no circuit of length 8 or 12.

Path covers of weighted graphs

✍ Genghua Fan 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 318 KB

Let (G, w ) denote a simple graph G with a weight function w : €(G) -{0,1,2}. A path cover of (G, w ) is a collection of paths in G such that every edge e is contained in exactly w(e) paths of the collection. For a vertex u , w ( v ) is the sum of the weights of the edges incident with U ; U is call

Perfect path double covers in every simp

Perfect path double covers in every simple graph

✍ Hao Li 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 229 KB

## Abstract We prove in this paper that every simple graph __G__ admits a perfect path double cover (PPDC), i.e., a set of paths of __G__ such that each edge of __G__ belongs to exactly two of the paths and each vertex of __G__ is an end of exactly two of the paths, where a path of length zero is c

Short cycle covers of cubic graphs

✍ Genghua Fan 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 461 KB

## Abstract Let __G__ be a bridgeless cubic graph. We prove that the edges of __G__ can be covered by circuits whose total length is at most (44/27) |__E(G)__|, and if Tutte's 3‐flow Conjecture is true, at most (92/57) |__E(G)__|.