The reconstruction conjecture for finite simple graphs and associated directed graphs
From MaRDI portal
Publication:2138987
DOI10.1016/J.DISC.2022.112893zbMATH Open1489.05105arXiv2003.06759OpenAlexW3011692338WikidataQ113877029 ScholiaQ113877029MaRDI QIDQ2138987FDOQ2138987
Authors: Tetsuya Hosaka
Publication date: 17 May 2022
Published in: Discrete Mathematics (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/2003.06759
Recommendations
Cites Work
- Title not available (Why is that?)
- Graph reconstruction—a survey
- A congruence theorem for trees
- Title not available (Why is that?)
- The reconstruction of maximal planar graphs. II: Reconstruction
- Computer reconstruction of small graphs
- Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
- Title not available (Why is that?)
- The reconstruction of maximal planar graphs. I: Recognition
- On the reconstruction of planar graphs
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- A new class of reconstructible graphs from some neighbourhood conditions
Cited In (10)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Switching reconstruction of digraphs
- A conjecture on the reconstruction of graphs from metric balls of their vertices
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
- A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths
- Title not available (Why is that?)
- Some remarks on Ádám's conjecture for simple directed graphs
- The 2-reconstructible indecomposable graphs.
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)