✦ LIBER ✦

An infinite class of reach-preservable graphs

✍ Scribed by Gagliardi, Daniel; Lewinter, Marty

Publisher: John Wiley and Sons
Year: 1997
Tongue: English
Weight: 42 KB
Volume: 29
Category: Article
ISSN: 0028-3045
DOI: 10.1002/(sici)1097-0037(199707)29:4<217::aid-net4>3.0.co;2-i

No coin nor oath required. For personal study only.

✦ Synopsis

for all w in G. G is called reach-preservable if each of its spanning trees contains at least one reachpreserving vertex. We show that K 2,n is reach-preservable. We show that a graph is bipartite if and only if given any pair of vertices, there exists a spanning tree in which both vertices a reach-preserved.

📜 SIMILAR VOLUMES

Mutation classes of diagrams via infinit

Mutation classes of diagrams via infinite graphs

✍ Thilo Henrich 📂 Article 📅 2011 🏛 John Wiley and Sons 🌐 English ⚖ 260 KB 👁 1 views

## Abstract We give a complete description of the cluster‐mutation classes of diagrams of Dynkin types \documentclass{article}\usepackage{amssymb}\begin{document}\pagestyle{empty}$\mathbb {A},\mathbb {B},\mathbb {D}$\end{document} and of affine Dynkin types \documentclass{article}\usepackage{amssym

Large classes of infinite k-cop-win grap

Large classes of infinite k-cop-win graphs

✍ Anthony Bonato; Geňa Hahn; Claude Tardif 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 104 KB 👁 1 views

While finite cop-win finite graphs possess a good structural characterization, none is known for infinite cop-win graphs. As evidence that such a characterization might not exist, we provide as large as possible classes of infinite graphs with finite cop number. More precisely, for each infinite car

An infinite family of biprimitive semisy

An infinite family of biprimitive semisymmetric graphs

✍ Du, Shao-Fei; Maru??i??, Dragan 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 296 KB 👁 1 views

A regular and edge-transitive graph that is not vertex-transitive is said to be semisymmetric. Every semisymmetric graph is necessarily bipartite, with the two parts having equal size and the automorphism group acting transitively on each of these two parts. A semisymmetric graph is called biprimiti

Constructing an Infinite Family of Cubic

Constructing an Infinite Family of Cubic 1-Regular Graphs

✍ Yan-Quan Feng; Jin Ho Kwak 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 89 KB

A graph is 1-regular if its automorphism group acts regularly on the set of its arcs. Miller [J. Comb. Theory, B, 10 (1971), 163-182] constructed an infinite family of cubic 1-regular graphs of order 2 p, where p ≥ 13 is a prime congruent to 1 modulo 3. Marušič and Xu [J. Graph Theory, 25 (1997), 13

The bond and cycle spaces of an infinite

The bond and cycle spaces of an infinite graph

✍ Karel Casteels; R. Bruce Richter 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB 👁 1 views

## 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 w

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 _