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 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.
Recommendations
Cites work
- scientific article; zbMATH DE number 3141308 (Why is no real title available?)
- scientific article; zbMATH DE number 1051281 (Why is no real title available?)
- scientific article; zbMATH DE number 3317675 (Why is no real title available?)
- A congruence theorem for trees
- A new class of reconstructible graphs from some neighbourhood conditions
- Computer reconstruction of small graphs
- Graph reconstruction—a survey
- On the reconstruction of planar graphs
- Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
- The reconstruction conjecture is true if all 2-connected graphs are reconstructible
- The reconstruction of maximal planar graphs. I: Recognition
- The reconstruction of maximal planar graphs. II: Reconstruction
Cited in
(11)- scientific article; zbMATH DE number 5287238 (Why is no real title available?)
- scientific article; zbMATH DE number 4097431 (Why is no real title available?)
- scientific article; zbMATH DE number 3912429 (Why is no real title available?)
- A conjecture on the reconstruction of graphs from metric balls of their vertices
- Switching reconstruction of digraphs
- Vertex-substitution framework verifies the reconstruction conjecture for finite undirected graphs
- A reconstrability conjecture for graphs with restrictions for 4-vertex simple paths
- scientific article; zbMATH DE number 4063134 (Why is no real title available?)
- Reconstructible graphs, simplicial flag complexes of homology manifolds and associated right-angled Coxeter groups
- 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)