𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Genus of cartesian products of regular bipartite graphs

✍ Scribed by Tomaž Pisanski

Publisher
John Wiley and Sons
Year
1980
Tongue
English
Weight
545 KB
Volume
4
Category
Article
ISSN
0364-9024

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Nonorientable genus of cartesian product
Nonorientable genus of cartesian products of regular graphs
✍ Tomaž Pisanski 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 565 KB

## Abstract A special type of surgery developed by A. T. White and later used by the author to construct orientable quadrilateral embeddings of Cartesian products of graphs is here expanded to cover the nonorientable case as well. This enables the nonorientable genus of many families of Cartesian p

Embeddings of cartesian products of near
Embeddings of cartesian products of nearly bipartite graphs
✍ Bojan Mohar; Tomaž Pisanski; Arthur T. White 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 384 KB

## Abstract Surgical techniques are often effective in constructing genus embeddings of cartesian products of bipartite graphs. In this paper we present a general construction that is “close” to a genus embedding for cartesian products, where each factor is “close” to being bipartite. In specializi

Decompositions of regular bipartite grap
Decompositions of regular bipartite graphs
✍ Michael S. Jacobson; Miroslaw Truszczyński; Zsolt Tuza 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 692 KB

In this paper we discuss isomorphic decompositions of regular bipartite graphs into trees and forests. We prove that: (1) there is a wide class of r-regular bipartite graphs that are decomposable into any tree of size r, (2) every r-regular bipartite graph decomposes into any double star of size r,

Tails of Bipartite Distance-regular Grap
Tails of Bipartite Distance-regular Graphs
✍ Michael S. Lang 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 205 KB

Let denote a bipartite distance-regular graph with diameter D ≥ 4 and valency k ≥ 3. Let θ 0 > θ 1 > • • • > θ D denote the eigenvalues of and let E 0 , E 1 , . . . , E D denote the associated primitive idempotents. Fix s (1 ≤ s ≤ D -1) and abbreviate E := E s . We say E is a tail whenever the entry

Regular orientable embeddings of complet
Regular orientable embeddings of complete bipartite graphs
✍ Jin Ho Kwak; Young Soo Kwon 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 199 KB

## Abstract In this paper, it will be shown that the isomorphism classes of regular orientable embeddings of the complete bipartite graph __K__~__n,n__~ are in one‐to‐one correspondence with the permutations on __n__ elements satisfying a given criterion, and the isomorphism classes of them are com