arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2303.06609cs.DMmath.CO
收藏

由连通三元组重构图

Reconstructing Graphs from Connected Triples

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

摘要:

我们引入了一个新的模型的不确定性图:而不是指定所有的边的图,输入包含所有的三元组的顶点,形成一个连通的子图。一般来说,不同的(标记的)图可能有相同的连接三元组,使得从三元组唯一重建原始图是不可能的。我们确定了一些家庭的图(包括三角形的自由图),所有的图有一个不同的一组连通三元组。我们还给出了算法,重建一个图从一组三元组,并测试,如果这种重建是唯一的。最后,我们研究了一个可能的扩展模型中的子集的大小$k$,诱导一个连接的图形给出较大的(固定)值的$k$。

英文摘要:

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$.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑