外平面Turán路径不相交副本的数目

IF 3.5 2区数学 Q1 MATHEMATICS, APPLIED

Applied Mathematics and Computation Pub Date : 2025-01-16 DOI:10.1016/j.amc.2025.129296

Jin Li , Yongxin Lan , Changqing Xu

引用次数: 0

摘要

不包含T的子图称为无T图。T的外平面Turán number exOP（n，T）表示所有n顶点无T的外平面图的最大边数。本文研究了exOP（n,rPs）在r、s≥2和n≥rs条件下的精确值。这延伸了Fang和Zhai (2023) b[7]的结果。

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

查看原文本刊更多论文

The outerplanar Turán number of disjoint copies of paths

A graph without a copy of T as a subgraph is called T-free. The outerplanar Turán number

e x_{_{O P}} (n, T)

of T represents the maximum number of edges among all n-vertex T-free outerplanar graphs. In this paper, we investigate

e x_{_{O P}} (n, r P_{s})

and determine its exact value for

r, s \geq 2

and

n \geq r s

. This extends a result of Fang and Zhai (2023) [7].

求助全文

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

来源期刊

Applied Mathematics and Computation 数学-应用数学

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.