Reconstructing Graphs from Connected Triples
Abstract
We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set of connected triples, making unique reconstruction of the original graph from the triples impossible. We identify some families of graphs (including triangle-free graphs) for which all graphs have a different set of connected triples. We also give algorithms that reconstruct a graph from a set of triples, and for testing if this reconstruction is unique. Finally, we study a possible extension of the model in which the subsets of size that induce a connected graph are given for larger (fixed) values of .
Cite
@article{arxiv.2303.06609,
title = {Reconstructing Graphs from Connected Triples},
author = {Paul Bastide and Linda Cook and Jeff Erickson and Carla Groenland and Marc van Kreveld and Isja Mannens and Jordi L. Vermeulen},
journal= {arXiv preprint arXiv:2303.06609},
year = {2023}
}
Comments
20 pages including appendices