三次图中的不相交成对支配集
Disjoint Paired-Dominating sets in Cubic Graphs.
作者信息
Bacsó Gábor, Bujtás Csilla, Tompkins Casey, Tuza Zsolt
机构信息
1Computer and Automation Institute, Hungarian Academy of Sciences, Budapest, Hungary.
2Faculty of Information Technology, University of Pannonia, Veszprém, Hungary.
出版信息
Graphs Comb. 2019;35(5):1129-1138. doi: 10.1007/s00373-019-02063-w. Epub 2019 Jul 15.
Abstract
A paired-dominating set of a graph is a dominating set with the additional requirement that the induced subgraph [] contains a perfect matching. We prove that the vertex set of every claw-free cubic graph can be partitioned into two paired-dominating sets.
摘要
图的一个配对支配集是一个支配集，额外要求导出子图[ ]包含一个完美匹配。我们证明每个无爪立方图的顶点集都可以划分为两个配对支配集。
相似文献
1
Disjoint Paired-Dominating sets in Cubic Graphs.三次图中的不相交成对支配集
Graphs Comb. 2019;35(5):1129-1138. doi: 10.1007/s00373-019-02063-w. Epub 2019 Jul 15.
2
On the characterization of claw-free graphs with given total restrained domination number.关于具有给定全约束支配数的无爪图的特征
Springerplus. 2016 Oct 7;5(1):1753. doi: 10.1186/s40064-016-3387-7. eCollection 2016.
3
On Hamiltonian Decomposition Problem of 3-Arc Graphs.关于三弧图的哈密顿分解问题
Comput Intell Neurosci. 2022 Apr 28;2022:5837405. doi: 10.1155/2022/5837405. eCollection 2022.
4
On the Decomposition of Vertex-Transitive Graphs into Multicycles.关于顶点传递图分解为多圈图的研究
J Res Natl Bur Stand (1977). 1983 Nov-Dec;88(6):403-410. doi: 10.6028/jres.088.021.
5
Anti-Kekulé number of the {(3, 4), 4}-fullerene.{(3, 4), 4}-富勒烯的反凯库勒数
Front Chem. 2023 Feb 24;11:1132587. doi: 10.3389/fchem.2023.1132587. eCollection 2023.
6
The dominant metric dimension of graphs.图的主导度量维度
Heliyon. 2020 Mar 23;6(3):e03633. doi: 10.1016/j.heliyon.2020.e03633. eCollection 2020 Mar.
7
Parameterized Complexity and Inapproximability of Dominating Set Problem in Chordal and Near Chordal Graphs.弦图和近弦图中支配集问题的参数化复杂性与不可近似性
J Comb Optim. 2010 Apr 15;20(2):1-15. doi: 10.1007/s10878-010-9317-7.
8
On Vertex Covering Transversal Domination Number of Regular Graphs.关于正则图的顶点覆盖横贯支配数
ScientificWorldJournal. 2016;2016:1029024. doi: 10.1155/2016/1029024. Epub 2016 Mar 29.
9
Biomolecular and quantum algorithms for the dominating set problem in arbitrary networks.任意网络中支配集问题的生物分子和量子算法。
Sci Rep. 2023 Mar 14;13(1):4205. doi: 10.1038/s41598-023-30600-4.
10
Enclaveless Sets and MK-Systems.无封闭集与MK系统
J Res Natl Bur Stand (1977). 1977 Nov-Dec;82(3):197-202. doi: 10.6028/jres.082.019.
Zotero 插件