✦ LIBER ✦

The graph reconstruction number

✍ Scribed by Frank Harary; Michael Plantholt

Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 177 KB
Volume: 9
Category: Article
ISSN: 0364-9024
DOI: 10.1002/jgt.3190090403

No coin nor oath required. For personal study only.

✦ Synopsis

Dedicated ro the memory of Stan Ulam (31.

📜 SIMILAR VOLUMES

The edge reconstruction number of a disc

The edge reconstruction number of a disconnected graph

✍ Robert Molina 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 532 KB

Almost every graph has reconstruction nu

Almost every graph has reconstruction number three

✍ Béla Bollobás 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 153 KB

## Abstract The paper contains a proof of the conjecture of Harary and Plantholt, stated in the title.

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 _

Reconstructing the degree sequence and t

Reconstructing the degree sequence and the number of components of an infinite graph

✍ Thomas Andreae 📂 Article 📅 1982 🏛 Elsevier Science 🌐 English ⚖ 812 KB

We prove that the degree sequence of an infinite graph is reconstructibjle from its family of vertex-deleted subgraphs. Furthermore, as another result concerning the reconstruction of infinite graphs, we prove that the number c(G) of components of an infinite graph G is re~ons~uct~b~e if there is at

The discipline number of a graph

✍ V. Chvátal; W. Cook 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 481 KB

The hull number of a graph

✍ Martin G Everett; Stephen B Seidman 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 379 KB

A set of points S of a graph is convex if any geodesic joining two points of S lies entirely within S. The convex hull of a set T of points is the smallest convex set that contains T. The hull number (h) of a graph is the cardinality of the smallest set of points whose convex hull is the entire grap