✦ LIBER ✦

Covers and strong covers in directed bipartite graphs

✍ Scribed by K. Vidyasankar

Publisher: John Wiley and Sons
Year: 1980
Tongue: English
Weight: 355 KB
Volume: 4
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190040305

No coin nor oath required. For personal study only.

✦ Synopsis

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 respect to V^+^.

📜 SIMILAR VOLUMES

Antipodal Distance-transitive Covers of

Antipodal Distance-transitive Covers of Complete Bipartite Graphs

✍ A.A. Ivanov; Robert A. Liebler; Tim Penttila; Cheryl E. Praeger 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 480 KB

This paper completes the classification of antipodal distance-transitive covers of the complete bipartite graphs K k , k , where k у 3 . For such a cover the antipodal blocks must have size r р k . Although the case r ϭ k has already been considered , we give a unified treatment of r р k . We use d

Covers of graphs and EGQs

✍ Peter J. Cameron 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 645 KB

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 compl

Coverings of complete bipartite graphs a

Coverings of complete bipartite graphs and associated structures

✍ John Shawe-Taylor 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 648 KB

A construction is given of distance-regular q-fold covering graphs of the complete bipartite graph K qk,,pk, where q is the power of a prime number and k is any positive integer. Relations with associated distance-biregular graphs are also considered, resulting in the construction of a family of dis

Optimal path cover problem on block grap

Optimal path cover problem on block graphs and bipartite permutation graphs

✍ R. Srikant; Ravi Sundaram; Karan Sher Singh; C. Pandu Rangan 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 365 KB

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.