首页|Bounds on the paired domination number of graphs with minimum degree at least three
Bounds on the paired domination number of graphs with minimum degree at least three
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NSTL
Elsevier
A set Sof vertices in a graph G is a paired dominating set if every vertex of G is adjacent to a vertex in Sand the subgraph induced by Scontains a perfect matching (not necessarily as an induced subgraph). The minimum cardinality of a paired dominating set of G is the paired domination number gamma(pr)(G) of G. In this paper, we show that if G is a graph of order n and delta(G) >= 3, then gamma(pr)(G) <= 19037/30000 n < 0.634567 n. (C) 2021 Elsevier Inc. All rights reserved.
Paired dominationBounds
Henning, Michael A.、Pilsniak, Monika、Tumidajewicz, Elzbieta
NSTL
Elsevier
