The reconstruction conjecture for finite simple graphs and associated directed graphs

From MaRDI portal
Publication:2138987




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(Gamma)ightarrowV(Gamma) and for any vinV(Gamma), there exists an isomorphism phiv:GammavoGammaf(v). Then we define the associated directed graph widetildeGamma=widetildeGamma(Gamma,Gamma,f,phivvinV(Gamma)) with two kinds of arrows from the graphs Gamma and Gamma, the bijective map f and the isomorphisms phivvinV(Gamma). By investigating the associated directed graph widetildeGamma, we study when are the two graphs Gamma and Gamma isomorphic.









This page was built for publication: The reconstruction conjecture for finite simple graphs and associated directed graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2138987)