跳到主要导航 跳到搜索 跳到主要内容

Regular graphs with equal weakly connected domination number and matching number

  • Northwestern Polytechnical University Xian
  • School of Mathematics and Statistics
  • Xinjiang University

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

Let G be a connected graph with vertex set V(G). A weakly connected dominating set W of G is a dominating set of G such that the subgraph consisting of V(G) and all edges incident with vertices in W is connected. The minimum cardinality among all weakly connected dominating sets of G is called the weakly connected domination number, denoted by γw(G). Bermudo, Dettlaff, and Lemańska (Discrete Appl. Math., 304 (2021), 153–163) posed a conjecture which says that if G is a regular graph of order |V(G)|≥3, then γw(G)=μ(G) if and only if G is a cycle, where μ(G) denotes the matching number of G. In this paper, we show that the conjecture is true.

源语言英语
页(从-至)43-55
页数13
期刊Discrete Applied Mathematics
卷388
DOI
出版状态已出版 - 31 7月 2026

学术指纹

探究 'Regular graphs with equal weakly connected domination number and matching number' 的科研主题。它们共同构成独一无二的学术指纹。

引用此