✦ LIBER ✦

Coverings of complete bipartite graphs and associated structures

✍ Scribed by John Shawe-Taylor

Publisher: Elsevier Science
Year: 1994
Tongue: English
Weight: 648 KB
Volume: 134
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(93)e0070-k

No coin nor oath required. For personal study only.

✦ Synopsis

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 distance-bitransitive graphs.

📜 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

On the number of irreducible coverings b

On the number of irreducible coverings by edges of complete bipartite graphs

✍ Ioan Tomescu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 102 KB

In this paper it is proved that the exponential generating function of the numbers, denoted by N(p, q), of irreducible coverings by edges of the vertices of complete bipartite graphs Kp.q equals exp(xe r + ye x -x -y -xy) -t.

s-Regular cubic graphs as coverings of t

s-Regular cubic graphs as coverings of the complete bipartite graph K3,3

✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 138 KB

## Abstract A graph is __s‐regular__ if its automorphism group acts freely and transitively on the set of __s__‐arcs. An infinite family of cubic 1‐regular graphs was constructed in [10], as cyclic coverings of the three‐dimensional Hypercube. In this paper, we classify the __s__‐regular cyclic cov

Hall parameters of complete and complete

Hall parameters of complete and complete bipartite graphs

✍ M. M. Cropper; A. J. W. Hilton 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 287 KB

## Abstract Given a graph __G__, for each υ ∈__V__(__G__) let __L__(υ) be a list assignment to __G__. The well‐known choice number __c__(__G__) is the least integer __j__ such that if |__L__(υ)| ≥__j__ for all υ ∈__V__(__G__), then __G__ has a proper vertex colouring ϕ with ϕ(υ) ∈ __L__ (υ) (∀υ ∈__

Pagenumber of complete bipartite graphs

✍ Douglas J. Muder; Margaret Lefevre Weaver; Douglas B. West 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 929 KB

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