✦ LIBER ✦

Covers of graphs and EGQs

✍ Scribed by Peter J. Cameron

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 645 KB
Volume: 97
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(91)90424-z

No coin nor oath required. For personal study only.

✦ Synopsis

The puposes of this paper is the construction of some new extended generalized quadrangles, as covers of known esamples. The construction requires the vanishing of cohomology of certain simplicial complexes. One of the constructions generalizes to give some distance-regular antipodal covers of complete graphs, some of which also appear to be new.

📜 SIMILAR VOLUMES

Covers and strong covers in directed bip

Covers and strong covers in directed bipartite graphs

✍ K. Vidyasankar 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 355 KB

## Abstract Let __G__ be a finite graph with directed bipartition (__V__^+^, __V__^−^). Necessary and sufficient conditions are given for the existence of covers and strong covers that: (i) satisfy matching with respect to __V__^+^, and (ii) include a given set of edges that satisfies matching with

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.

Counting double covers of graphs

✍ M. Hofmeister 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 288 KB

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.

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

On total covers of graphs

✍ Yousef Alavi; Jiuqiang Liu; Jianfang Wang; Zhongfu Zhang 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 292 KB

Clique covers and coloring problems of g

Clique covers and coloring problems of graphs

✍ Walter Klotz 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 419 KB