✦ LIBER ✦

Switching reconstruction of digraphs

✍ Scribed by J. A. Bondy; F. Mercier

Publisher: John Wiley and Sons
Year: 2011
Tongue: English
Weight: 186 KB
Volume: 67
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.20535

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Vertex-Switching Reconstruction and Fold

Vertex-Switching Reconstruction and Folded Cubes

✍ M.N. Ellingham 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

In this note we use eigenvalues of folded cubes to simplify an analogue of Kelly's Lemma for vertex-switching reconstruction due to Krasikov and Roditty. Our new version states that the number of subgraphs (or induced subgraphs) of an n-vertex graph G isomorphic to a given m-vertex graph can be foun

Applications of balance equations to ver

Applications of balance equations to vertex switching reconstruction

✍ I. Krasikov 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 404 KB 👁 1 views

## Abstract A graph is called __s‐vertex switching reconstructible__ (__s__‐VSR) if it is uniquely defined, up to isomorphism, by the multiset of unlabeled graphs obtained by switching of all its __s__‐vertex subsets. We show that a graph with __n__ vertices is __n__/2‐VSR if __n__ = 0(mod 4), (__n

Hypotraceable digraphs

✍ Martin Grötschel; Carsten Thomassen; Yoshiko Wakabayashi 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 233 KB

## Abstract A hypotraceable digraph is a digraph __D__ = (__V, E__) which is not traceable, i.e., does not contain a (directed)Hamiltonian path, but for which __D__ ‐ __v__ is traceable for all __ve__ ∈ __V__. We prove that a hypotraceable digraph of order __n__ exists iff __n__ ≥ 7 and that for ea

Connectivity of circulant digraphs

✍ Erik A. Van Doorn 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 255 KB

An explicit expression is derived for the connectivity of circulant digraphs.

Girth in digraphs

✍ J. C. Bermond; A. Germa; M. C. Heydemann; D. Sotteau 📂 Article 📅 1980 🏛 John Wiley and Sons 🌐 English ⚖ 211 KB

## Abstract For an integer __k__ > 2, the best function __m__(__n, k__) is determined such that every strong digraph of order __n__ with at least __m__(__n, k__) arcs contains a circuit of length __k__ or less.

Counting strong digraphs

✍ Robert W. Robinson 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 94 KB