✦ LIBER ✦

The bond and cycle spaces of an infinite graph

✍ Scribed by Karel Casteels; R. Bruce Richter

Publisher: John Wiley and Sons
Year: 2008
Tongue: English
Weight: 166 KB
Volume: 59
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20331

No coin nor oath required. For personal study only.

✦ Synopsis

Abstract

Bonnington and Richter defined the cycle space of an infinite graph to consist of the sets of edges of subgraphs having even degree at every vertex. Diestel and Kühn introduced a different cycle space of infinite graphs based on allowing infinite circuits. A more general point of view was taken by Vella and Richter, thereby unifying these cycle spaces. In particular, different compactifications of locally finite graphs yield different topological spaces that have different cycle spaces. In this work, the Vella‐Richter approach is pursued by considering cycle spaces over all fields, not just ℤ~2~. In order to understand “orthogonality” relations, it is helpful to consider two different cycle spaces and three different bond spaces. We give an analog of the “edge tripartition theorem” of Rosenstiehl and Read and show that the cycle spaces of different compactifications of a locally finite graph are related. © 2008 Wiley Periodicals, Inc. J Graph Theory 59: 162–176, 2008

📜 SIMILAR VOLUMES

The cycle space of an embedded graph

✍ B. Richter; H. Shank 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 258 KB 👁 1 views

## Abstract Let __G__ be a connected graph with edge set __E__ embedded in the surface ∑. Let __G__° denote the geometric dual of __G__. For a subset __d__ of __E__, let τ__d__ denote the edges of __G__° that are dual to those edges of __G__ in __d__. We prove the following generalizations of well‐

Cycle systems of the line graph of the c

Cycle systems of the line graph of the complete graph

✍ Cox, B.A.; Rodger, C.A. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 562 KB

For all m = 0 (mod 41, for all n = 0 or 2 (mod m), and for all n = 1 (mod 2m) w e find an m-cycle decomposition of the line graph of the complete graph K,. In particular, this solves the existence problem when m is a power of two.

Reconstructing the number of copies of a

Reconstructing the number of copies of a valency-labeled finite graph in an infinite graph

✍ A. J. H. King; C. St. J. A. Nash-Williams 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 489 KB 👁 1 views

## Abstract Suppose that __G, H__ are infinite graphs and there is a bijection Ψ; V(G) Ψ V(H) such that __G__ ‐ ξ ≅ H ‐ Ψ(ξ) for every ξ ∼ __V__(G). Let __J__ be a finite graph and /(π) be a cardinal number for each π ≅ __V__(J). Suppose also that either /(π) is infinite for every π ≅ __V__(J) or _

On the notion of infinite Hamiltonian gr

On the notion of infinite Hamiltonian graph

✍ R. Halin 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 184 KB 👁 1 views

## Abstract Based on the terms “end” and “cofinal spanning subtree” a general notion of Hamiltonicity of infinite graphs is developed. It is shown that the cube of every connected locally finite graph is Hamiltonian in this generalized sense.

On the cycle polytope of a directed grap

On the cycle polytope of a directed graph

✍ Egon Balas; Maarten Oosten 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 185 KB 👁 2 views

Symmetric Hamilton cycle decompositions

Symmetric Hamilton cycle decompositions of the complete graph

✍ Jin Akiyama; Midori Kobayashi; Gisaku Nakamura 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 95 KB 👁 1 views