The reconstruction conjecture of Stanislaw Ulam is one of the best-known open problems in graph theory. Using the terminology of Frank Harary it can be stated as follows: If G and H are two graphs on at least three vertices and ƒ is a bijection from V to V such that G\ and H\ are isomorphic for all vertices v in V, then G and H are isomorphic. In 1964 Harary extended the reconstruction conjecture to directed graphs on at least five vertices as the so-called digraphreconstruction conjecture. Many results supporting the digraph reconstruction conjecture appeared between 1964 and 1976. However, this conjecture was proved to be false when P. K. Stockmeyer discovered several infinite families of counterexample pairs of digraphs of arbitrarily large order. The falsity of the digraph reconstruction conjecture caused doubt about the reconstruction conjecture itself. Stockmeyer even observed that “perhaps the considerable effort being spent in attempts to prove the conjecture should be balanced by more serious attempts to construct counterexamples.” In 1979, Ramachandran revived the digraph reconstruction conjecture in a slightly weaker form called the new digraph reconstruction conjecture. In a digraph, the number of arcs incident from a vertexv is called the outdegree of v and is denoted by od. The new digraph conjecture may be stated as follows: The new digraph reconstruction conjecture reduces to the reconstruction conjecture in the undirected case, because if all the vertex-deleted subgraphs of two graphs are isomorphic, then the corresponding vertices must have the same degree. Thus, the new digraph reconstruction conjecture is stronger than the reconstruction conjecture, but weaker than the disproved digraph reconstruction conjecture. Several families of digraphs have been shown to satisfy the new digraph reconstruction conjecture and these include all the digraphs in the known counterexample pairs to the digraph reconstruction conjecture.
Reduction
All Digraphs are N-reconstructible if all Digraphs with 2-connected underlying Graphs are N-reconstructible.
All Digraphs are N-reconstructible if and only if either of the following two classes of Digraphs are N-reconstructible, where diam and radius are defined to be the diameter and radius of the underlying graph of D.
#Digraphs with diam ≤ 2 or diam = diam = 3
#Digraphs D with 2-connected underlying graphs and radius ≤ 2
Present Status
As of 2018, no counterexample to the new digraph reconstruction conjecture is known.
