Edge reconstruction and the swapping number of a graph

Dalibor Froncek, Amy Hlavacek, Steven J. Rosenberg

Research output: Contribution to journalArticlepeer-review

1 Scopus citations

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 languageEnglish (US)
Pages (from-to)1-15
Number of pages15
JournalAustralasian Journal of Combinatorics
Volume58
Issue number1
StatePublished - Jan 2 2014

Fingerprint

Dive into the research topics of 'Edge reconstruction and the swapping number of a graph'. Together they form a unique fingerprint.

Cite this