The outerplanar Turán number of disjoint copies of paths

IF 3.5 2区 数学 Q1 MATHEMATICS, APPLIED
Jin Li , Yongxin Lan , Changqing Xu
{"title":"The outerplanar Turán number of disjoint copies of paths","authors":"Jin Li ,&nbsp;Yongxin Lan ,&nbsp;Changqing Xu","doi":"10.1016/j.amc.2025.129296","DOIUrl":null,"url":null,"abstract":"<div><div>A graph without a copy of <em>T</em> as a subgraph is called <em>T</em>-free. The outerplanar Turán number <span><math><mi>e</mi><msub><mrow><mi>x</mi></mrow><mrow><msub><mrow></mrow><mrow><mi>O</mi><mi>P</mi></mrow></msub></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>T</mi><mo>)</mo></math></span> of <em>T</em> represents the maximum number of edges among all <em>n</em>-vertex <em>T</em>-free outerplanar graphs. In this paper, we investigate <span><math><mi>e</mi><msub><mrow><mi>x</mi></mrow><mrow><msub><mrow></mrow><mrow><mi>O</mi><mi>P</mi></mrow></msub></mrow></msub><mo>(</mo><mi>n</mi><mo>,</mo><mi>r</mi><msub><mrow><mi>P</mi></mrow><mrow><mi>s</mi></mrow></msub><mo>)</mo></math></span> and determine its exact value for <span><math><mi>r</mi><mo>,</mo><mi>s</mi><mo>≥</mo><mn>2</mn></math></span> and <span><math><mi>n</mi><mo>≥</mo><mi>r</mi><mi>s</mi></math></span>. This extends a result of Fang and Zhai (2023) <span><span>[7]</span></span>.</div></div>","PeriodicalId":55496,"journal":{"name":"Applied Mathematics and Computation","volume":"494 ","pages":"Article 129296"},"PeriodicalIF":3.5000,"publicationDate":"2025-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Applied Mathematics and Computation","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0096300325000232","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

A graph without a copy of T as a subgraph is called T-free. The outerplanar Turán number exOP(n,T) of T represents the maximum number of edges among all n-vertex T-free outerplanar graphs. In this paper, we investigate exOP(n,rPs) and determine its exact value for r,s2 and nrs. This extends a result of Fang and Zhai (2023) [7].
外平面Turán路径不相交副本的数目
不包含T的子图称为无T图。T的外平面Turán number exOP(n,T)表示所有n顶点无T的外平面图的最大边数。本文研究了exOP(n,rPs)在r、s≥2和n≥rs条件下的精确值。这延伸了Fang和Zhai (2023) b[7]的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
7.90
自引率
10.00%
发文量
755
审稿时长
36 days
期刊介绍: Applied Mathematics and Computation addresses work at the interface between applied mathematics, numerical computation, and applications of systems – oriented ideas to the physical, biological, social, and behavioral sciences, and emphasizes papers of a computational nature focusing on new algorithms, their analysis and numerical results. In addition to presenting research papers, Applied Mathematics and Computation publishes review articles and single–topics issues.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信