On the difference of mean subtree orders under edge contraction

IF 1.2 1区 数学 Q1 MATHEMATICS Journal of Combinatorial Theory Series B Pub Date : 2024-06-18 DOI:10.1016/j.jctb.2024.06.002
Ruoyu Wang
{"title":"On the difference of mean subtree orders under edge contraction","authors":"Ruoyu Wang","doi":"10.1016/j.jctb.2024.06.002","DOIUrl":null,"url":null,"abstract":"<div><p>Given a tree <em>T</em> of order <em>n</em>, one can contract any edge and obtain a new tree <span><math><msup><mrow><mi>T</mi></mrow><mrow><mo>⁎</mo></mrow></msup></math></span> of order <span><math><mi>n</mi><mo>−</mo><mn>1</mn></math></span>. In 1983, Jamison made a conjecture that the mean subtree order, i.e., the average order of all subtrees, decreases at least <span><math><mfrac><mrow><mn>1</mn></mrow><mrow><mn>3</mn></mrow></mfrac></math></span> in contracting an edge of a tree. In 2023, Luo, Xu, Wagner and Wang proved the case when the edge to be contracted is a pendant edge. In this article, we prove that the conjecture is true in general.</p></div>","PeriodicalId":54865,"journal":{"name":"Journal of Combinatorial Theory Series B","volume":"169 ","pages":"Pages 45-62"},"PeriodicalIF":1.2000,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0095895624000467/pdfft?md5=bc686935124fe54d5af1a2d92fba12b9&pid=1-s2.0-S0095895624000467-main.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Combinatorial Theory Series B","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0095895624000467","RegionNum":1,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Given a tree T of order n, one can contract any edge and obtain a new tree T of order n1. In 1983, Jamison made a conjecture that the mean subtree order, i.e., the average order of all subtrees, decreases at least 13 in contracting an edge of a tree. In 2023, Luo, Xu, Wagner and Wang proved the case when the edge to be contracted is a pendant edge. In this article, we prove that the conjecture is true in general.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
论边缘收缩下平均子树顺序的差异
给定一棵阶数为 n 的树 T,可以收缩任意一条边,得到一棵阶数为 n-1 的新树 T⁎。1983 年,Jamison 提出了一个猜想,即在收缩树的一条边时,平均子树序(即所有子树的平均序)至少会减少 13。2023 年,Luo、Xu、Wagner 和 Wang 证明了要收缩的边是垂边时的情况。在本文中,我们将证明该猜想在一般情况下为真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
CiteScore
2.70
自引率
14.30%
发文量
99
审稿时长
6-12 weeks
期刊介绍: The Journal of Combinatorial Theory publishes original mathematical research dealing with theoretical and physical aspects of the study of finite and discrete structures in all branches of science. Series B is concerned primarily with graph theory and matroid theory and is a valuable tool for mathematicians and computer scientists.
期刊最新文献
Editorial Board Some results and problems on tournament structure Ramsey numbers of bounded degree trees versus general graphs Tree amalgamations and quasi-isometries Clustered coloring of (path + 2K1)-free graphs on surfaces
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1