✦ LIBER ✦

Finite undirected graphs which are not reconstructible from their large cardinality subgraphs

✍ Scribed by Václav Nýdl

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 297 KB
Volume: 108
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(92)90689-d

No coin nor oath required. For personal study only.

✦ Synopsis

Nydl, V., Finite undirected graphs which are not reconstructible from their large cardinality subgraphs, Discrete Mathematics 108 (1992) 373-377.

For any integer n, and any real q, 0 < q < 1, we exhibit two nonisomorphic graphs on n > n,, vertices having the same collections of m-vertex subgraphs where m is the integral part of q . n.