✦ LIBER ✦

On two-factors of bipartite regular graphs

✍ Scribed by J.D. Horton

Publisher: Elsevier Science
Year: 1982
Tongue: English
Weight: 654 KB
Volume: 41
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(82)90079-6

No coin nor oath required. For personal study only.

✦ Synopsis

The set of two-factors of a bipartite k-regular graph, k > 2, spans the cycle space of the graph. In addition, a new non-hamiltonian T-connected bicubic graph on 92 vertices is constructed.

📜 SIMILAR VOLUMES

Counting 1-Factors in Regular Bipartite

Counting 1-Factors in Regular Bipartite Graphs

✍ Alexander Schrijver 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 325 KB

We show that any k-regular bipartite graph with 2n vertices has at least \ (k&1) k&1 k k&2 + n perfect matchings (1-factors). Equivalently, this is a lower bound on the permanent of any nonnegative integer n\_n matrix with each row and column sum equal to k. For any k, the base (k&1) k&1 Âk k&2 is l

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,

Spin Models on Bipartite Distance-Regula

Spin Models on Bipartite Distance-Regular Graphs

✍ K. Nomura 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 430 KB

Spin models were introduced by V. Jones (Pac. J. Math. 137 (1989), 311-336) to construct invariants of knots and links. A spin model will be defined as a pair \(S=(X, w)\) of a finite set \(X\) and a function \(w\) on \(X \times X\) satisfying several axioms. Some important spin models can be constr

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

Two spectral characterizations of regula

Two spectral characterizations of regular, bipartite graphs with five eigenvalues

✍ Dragan Stevanović 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 650 KB

Regular factors of regular graphs

✍ B. Bollobás; Akira Saito; N. C. Wormald 📂 Article 📅 1985 🏛 John Wiley and Sons 🌐 English ⚖ 242 KB

Given r 3 3 and 1 s A s r, we determine all values of k for which every r-regular graph with edge-connectivity A has a k-factor. Some of the earliest results in graph theory are due to Petersen [8] and concern factors in graphs. Among others, Petersen proved that a regular graph of even degree has a