The Reconstruction Conjecture for finite simple graphs and associated directed graphs
Combinatorics
2021-06-22 v2
Abstract
In this paper, we study the Reconstruction Conjecture for finite simple graphs. Let and be finite simple graphs with at least three vertices such that there exists a bijective map and for any , there exists an isomorphism . Then we define the associated directed graph with two kinds of arrows from the graphs and , the bijective map and the isomorphisms . By investigating the associated directed graph , we study when are the two graphs and isomorphic.
Cite
@article{arxiv.2003.06759,
title = {The Reconstruction Conjecture for finite simple graphs and associated directed graphs},
author = {Tetsuya Hosaka},
journal= {arXiv preprint arXiv:2003.06759},
year = {2021}
}
Comments
26 pages, 16 figures