On the oriented diameter of near planar triangulations

IF 0.7 3区 数学 Q2 MATHEMATICS Discrete Mathematics Pub Date : 2025-05-01 Epub Date: 2025-01-23 DOI:10.1016/j.disc.2025.114406
Yiwei Ge , Xiaonan Liu , Zhiyu Wang
{"title":"On the oriented diameter of near planar triangulations","authors":"Yiwei Ge ,&nbsp;Xiaonan Liu ,&nbsp;Zhiyu Wang","doi":"10.1016/j.disc.2025.114406","DOIUrl":null,"url":null,"abstract":"<div><div>In this paper, we show that the oriented diameter of any <em>n</em>-vertex 2-connected near triangulation is at most <span><math><mo>⌈</mo><mfrac><mrow><mi>n</mi></mrow><mrow><mn>2</mn></mrow></mfrac><mo>⌉</mo></math></span> (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang et al. (2021) <span><span>[29]</span></span> on the oriented diameter of maximal outerplanar graphs, and improves an upper bound of <span><math><mi>n</mi><mo>/</mo><mn>2</mn><mo>+</mo><mi>O</mi><mo>(</mo><msqrt><mrow><mi>n</mi></mrow></msqrt><mo>)</mo></math></span> on the oriented diameter of planar triangulations by Mondal et al. (2024) <span><span>[24]</span></span>.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 5","pages":"Article 114406"},"PeriodicalIF":0.7000,"publicationDate":"2025-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X25000147","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2025/1/23 0:00:00","PubModel":"Epub","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

In this paper, we show that the oriented diameter of any n-vertex 2-connected near triangulation is at most n2 (except for seven small exceptions), and the upper bound is tight. This extends a result of Wang et al. (2021) [29] on the oriented diameter of maximal outerplanar graphs, and improves an upper bound of n/2+O(n) on the oriented diameter of planar triangulations by Mondal et al. (2024) [24].
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
近平面三角形的定向直径
在本文中,我们表明,面向直径的n点2-connected三角附近最多⌈n2⌉(七个小例外除外),上界是紧。这扩展了Wang et al.(2021)[29]关于最大外平面图的定向直径的结果,并改进了Mondal et al.(2024)[24]关于平面三角形的定向直径的上界n/2+O(n)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
期刊最新文献
Paradoxical behavior in Collatz sequences Leaf to leaf path lengths in trees of given degree sequence Generalized snake posets, order polytopes, and lattice-point enumeration A note on the spectral radius and [a,b]-factor of graphs Construction of Hermitian self-dual constacyclic codes with square-root-like lower bounds on the minimum distances
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1