𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Reconstructing graphs from their k-edge deleted subgraphs

✍ Scribed by C.D Godsil; I Krasikov; Y Roditty

Book ID
107884251
Publisher
Elsevier Science
Year
1987
Tongue
English
Weight
166 KB
Volume
43
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Reconstructing degree sequences from k-v
Reconstructing degree sequences from k-vertex-deleted subgraphs
✍ Richard Taylor πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 362 KB

Let k 23 be an integer. We show that the degree sequences of all sufficiently large graphs are determined by their k-vertex-deleted subgraphs. In particular, this is shown for all graphs on at least f(k) vertices, where f(k) IS a certain function which is asymptotic to ke.

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

Nearly uniform distribution of edges amo
Nearly uniform distribution of edges among k-subgraphs of a graph
✍ Jozef Ε irÑň; Zsolt Tuza πŸ“‚ Article πŸ“… 1992 πŸ› John Wiley and Sons 🌐 English βš– 671 KB

## Abstract We investigate the behavior of the function __f__ = __f(n, k, e)__ defined as the smallest integer with the following property: If in a graph on __n__ vertices, the numbers of edges in any two induced subgraphs on __k__ vertices differ by at most __e__, then the graph or its complement