Abstract
We define the swapping number of an arbitrary simple graph, which is related to edge reconstruction, and involves a weakening of the concept of a graph automorphism. We classify all 1-swappable trees and unicyclic graphs and prove that the expected value of the swapping number grows linearly with the order of the graph.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 1-15 |
| Number of pages | 15 |
| Journal | Australasian Journal of Combinatorics |
| Volume | 58 |
| Issue number | 1 |
| State | Published - 2014 |