Reconstructing Graphs from Connected Triples

Isja Mannens, Carla Groenland, Marc van Kreveld, Paul Bastide, Linda Cook, Jeff Erickson, Jordi Luca Vermeulen

Research output: Chapter in Book/Conference proceedings/Edited volumeConference contributionScientificpeer-review

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 k that induce a connected graph are given for larger (fixed) values of k.
Original languageEnglish
Title of host publicationWG 2023, Fribourg, Switzerland, 28/06/23
DOIs
Publication statusPublished - 2023
Externally publishedYes

Fingerprint

Dive into the research topics of 'Reconstructing Graphs from Connected Triples'. Together they form a unique fingerprint.

Cite this