Ann Clifton , Éva Czabarka , Kevin Liu , Sarah Loeb , Utku Okur , László Székely , Kristina Wicke
{"title":"Reconstruction of caterpillar tanglegrams","authors":"Ann Clifton , Éva Czabarka , Kevin Liu , Sarah Loeb , Utku Okur , László Székely , Kristina Wicke","doi":"10.1016/j.dam.2025.09.022","DOIUrl":null,"url":null,"abstract":"<div><div>A tanglegram consists of two rooted binary trees with the same number of leaves and a perfect matching between the leaves of the trees. Given a size-<span><math><mi>n</mi></math></span> tanglegram, i.e., a tanglegram for two trees with <span><math><mi>n</mi></math></span> leaves, a multiset of induced size-<span><math><mrow><mo>(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></math></span> tanglegrams is obtained by deleting a pair of matched leaves in every possible way. Here, we analyze whether a size-<span><math><mi>n</mi></math></span> tanglegram is uniquely encoded by this multiset of size-<span><math><mrow><mo>(</mo><mi>n</mi><mo>−</mo><mn>1</mn><mo>)</mo></mrow></math></span> tanglegrams. We answer this question affirmatively in the case that at least one of the two trees of the tanglegram is a caterpillar tree.</div></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"378 ","pages":"Pages 647-661"},"PeriodicalIF":1.0000,"publicationDate":"2025-09-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X25005438","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0
Abstract
A tanglegram consists of two rooted binary trees with the same number of leaves and a perfect matching between the leaves of the trees. Given a size- tanglegram, i.e., a tanglegram for two trees with leaves, a multiset of induced size- tanglegrams is obtained by deleting a pair of matched leaves in every possible way. Here, we analyze whether a size- tanglegram is uniquely encoded by this multiset of size- tanglegrams. We answer this question affirmatively in the case that at least one of the two trees of the tanglegram is a caterpillar tree.
期刊介绍:
The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal.
Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.