近平面三角形的定向直径

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

引用次数: 0

摘要

在本文中,我们表明,面向直径的n点2-connected三角附近最多⌈n2⌉(七个小例外除外),上界是紧。这扩展了Wang et al.(2021)[29]关于最大外平面图的定向直径的结果，并改进了Mondal et al.(2024)[24]关于平面三角形的定向直径的上界n/2+O(n)。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

On the oriented diameter of near planar triangulations

In this paper, we show that the oriented diameter of any n-vertex 2-connected near triangulation is at most

⌈ \frac{n}{2} ⌉

(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 (\sqrt{n})

on the oriented diameter of planar triangulations by Mondal et al. (2024) [24].

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

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.

期刊最新文献

Generator matrices of quasi-cyclic codes New constant dimension subspace codes by multilevel and parallel linkage constructions 3AP-free permutations have no exponential growth rate Squares of subcubic planar graphs without cycles of length 4–8 are 6-choosable Paradoxical behavior in Collatz sequences