New digraph reconstruction conjecture
id:
new-digraph-reconstruction-conjecture-293-3349154
title:
New digraph reconstruction conjecture
text:
The reconstruction conjecture of Stanisław 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(G) to V(H) such that G\{v} and H\{ƒ(v)} are isomorphic for all vertices v in V(G), 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 digraph reconstructi
brand slug:
wiki
category slug:
encyclopedia
description:
original url:
https://en.wikipedia.org/wiki/New_digraph_reconstruction_conjecture
date created:
date modified:
2024-03-26T22:06:43Z
main entity:
{"identifier":"Q7016399","url":"https://www.wikidata.org/entity/Q7016399"}
image:
fields total:
13
integrity:
13