arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2107.03750math.CO
收藏

无(bull图、diamond图)图的结构及其应用

Structure of (bull, diamond)-free graphs and its applications

Suchismita Mishra

AI总结:

该研究刻画了无(bull图、diamond图)图的完整结构,给出了此类可划分图的特征及多项式时间划分方法,推导了含三角形的相关图的cop数上界,并提及该结构定理的多项应用。

摘要:

本文探讨了无(bull图、diamond图)图的完整结构。作为该结构的一项应用,我们给出了可划分的无(bull图、diamond图)图的特征刻画。此外,我们证明了可划分的无(bull图、diamond图)图的此类划分可在多项式时间内找到。另外,我们表明,含三角形的无(bull图、diamond图)图的 cop 数至多比其直径小2。进一步地,对于任意自然数n>3,含三角形的连通无($P_n$、bull图、diamond图)图的cop数至多为$n-3$。我们还在结论部分讨论了无(bull图、diamond图)图结构定理的若干应用。

英文摘要:

This paper discusses the complete structure of the (bull, diamond)-free graphs. As an application of that, we give the characterization of the partitionable (bull, diamond)-free graphs. Moreover, we show that such a partition for a partitionable (bull, diamond)-free graph can be found in polynomial time. Additionally, we show that the cop number of a (bull, diamond)-free graph containing a triangle is at most two less than its diameter. Furthermore, the cop number of a connected ($P_n$, bull, diamond)-free graph with a triangle, is at most $n-3$, for any natural number $n>3$. We also discuss a couple of applications of the structural theorem of the (bull, diamond)-free graphs in the conclusions.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑