关于(1,2)-彩虹连接数的一些结果

IF 1 3区数学 Q3 MATHEMATICS, APPLIED

Discrete Applied Mathematics Pub Date : 2025-05-13 DOI:10.1016/j.dam.2025.05.008

Yingbin Ma, Yuyu Zhao

引用次数: 0

摘要

Li et al.,（2018）证明了rc1,2(G)+rc1,2（G¯）的锐上界，并留下了rc1,2(G)+rc1,2（G¯）的锐下界问题。在本文中，我们解决了这个问题，并给出了一些尖锐的例子。在Doan和Do（2023）中，证明了对于团数ω(G)≥n−3的大图G， rc1,2(G)≤3。然后我们完全确定了ω(G)≥n−3时G的(1,2)-彩虹连接数。

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

查看原文本刊更多论文

Some results on (1,2)-rainbow connection number

In Li et al., (2018), proved the sharp upper bound of

r c_{1, 2} (G) + r c_{1, 2} (\bar{G})

and left a problem of the sharp lower bound of

r c_{1, 2} (G) + r c_{1, 2} (\bar{G})

. In this article, we solve this problem and show some sharp examples. In Doan and Do (2023), proved that

r c_{1, 2} (G) \leq 3

for a graph

G

with large clique number

ω (G) \geq n - 3

. Then we completely determine the

(1, 2)

-rainbow connection number of

G

with

ω (G) \geq n - 3

求助全文

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

来源期刊

Discrete Applied Mathematics 数学-应用数学

CiteScore

2.30

自引率

9.10%

发文量

422

审稿时长

4.5 months

期刊介绍： The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.