𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On reconstructing graphs from their sets of subgraphs

✍ Scribed by Bennet Manvel

Publisher
Elsevier Science
Year
1976
Tongue
English
Weight
598 KB
Volume
21
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Finite undirected graphs which are not r
Finite undirected graphs which are not reconstructible from their large cardinality subgraphs
✍ VΓ‘clav NΓ½dl πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 297 KB

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 w

Graphs isomorphic to subgraphs of their
Graphs isomorphic to subgraphs of their line-graphs
✍ Douglas Bauer; Ralph Tindell πŸ“‚ Article πŸ“… 1982 πŸ› Elsevier Science 🌐 English βš– 621 KB

## An emhdding of graph G into graph N is by definition an isomorphism OI G onto a subgraph of H. It is shown in this paper that every unicycle V embeds in its line-graph L(V), and that every other connected graph that embeds in its own line-graph may be constructed from such an embedded unicycle