TY - JOUR
T1 - Regular graphs with equal weakly connected domination number and matching number
AU - Yang, Zixuan
AU - Lu, Hongliang
AU - Wu, Baoyindureng
AU - Zhang, Shenggui
N1 - Publisher Copyright:
© 2026 Elsevier B.V.
PY - 2026/7/31
Y1 - 2026/7/31
N2 - 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.
AB - 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.
KW - Matching number
KW - Regular graphs
KW - Weakly connected domination number
UR - https://www.scopus.com/pages/publications/105032175037
U2 - 10.1016/j.dam.2026.02.054
DO - 10.1016/j.dam.2026.02.054
M3 - 文章
AN - SCOPUS:105032175037
SN - 0166-218X
VL - 388
SP - 43
EP - 55
JO - Discrete Applied Mathematics
JF - Discrete Applied Mathematics
ER -