Graphs with arbitrarily large adversary degree associated reconstruction number
A vertex deleted unlabeled subgraph of a graph is a card. A dacard specifies the degree of the deleted vertex along with the card. The adversary degree associated reconstruction number of a graph G, denoted is the minimum number k such that every collection of k dacards of G uniquely determines G. A...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2020-09-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2019.12.022 |