English

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 Γ\Gamma and Γ\Gamma' be finite simple graphs with at least three vertices such that there exists a bijective map f:V(Γ)V(Γ)f:V(\Gamma) \rightarrow V(\Gamma') and for any vV(Γ)v\in V(\Gamma), there exists an isomorphism ϕv:ΓvΓf(v)\phi_v:\Gamma-v \to \Gamma'-f(v). Then we define the associated directed graph Γ~=Γ~(Γ,Γ,f,{ϕv}vV(Γ))\widetilde{\Gamma}=\widetilde{\Gamma}(\Gamma,\Gamma',f,\{\phi_v\}_{v\in V(\Gamma)}) with two kinds of arrows from the graphs Γ\Gamma and Γ\Gamma', the bijective map ff and the isomorphisms {ϕv}vV(Γ)\{\phi_v\}_{v\in V(\Gamma)}. By investigating the associated directed graph Γ~\widetilde{\Gamma}, we study when are the two graphs Γ\Gamma and Γ\Gamma' isomorphic.

Keywords

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

R2 v1 2026-06-23T14:15:04.293Z