具有路径型局部度条件的哈密顿无爪图

IF 0.7 3区数学 Q2 MATHEMATICS

Discrete Mathematics Pub Date : 2025-09-23 DOI:10.1016/j.disc.2025.114807

Xia Liu, Miao Wang, Shuo Zhang

引用次数: 0

摘要

设k为整数，Pk为k个顶点的路径。对于具有诱导Pk的图H，定义δPk(H)=min (dH(v)): v是H的诱导Pk的端点。证明了对于3连通非哈密顿无爪图H，对于任意1≤k≤9，δ pk (H)=δ(H)。作为副产品，我们得到了两个结果，扩展了Chen et al.(2017)[10]的结果。

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

查看原文本刊更多论文

Hamiltonian claw-free graphs with path-type local degree conditions

Let k be an integer and

P_{k}

be a path on k vertices. For a graph H with an induced

P_{k}

, define

δ_{P_{k}} (H) = \min {d_{H} (v)

: v is an end-vertex of an induced

P_{k}

of H}. In this paper, we prove that for a 3-connected non-Hamiltonian claw-free graph H,

δ_{P_{k}} (H) = δ (H)

for any

1 \leq k \leq 9

. As by-products, we obtained two results extend the results in Chen et al. (2017) [10].

求助全文

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

来源期刊

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.