Tropical dominating sets in vertex-coloured graphs

被引：1

作者：

d'Auriac, J. -A. Angles ^{[1
]}

Bujtas, Cs. ^{[2
]}

El Maftouhi, A. ^{[1
]}

Karpinski, M. ^{[3
]}

Manoussakis, Y. ^{[1
]}

Montero, L. ^{[1
]}

Narayanan, N. ^{[1
]}

Rosaz, L. ^{[1
]}

Thapper, J. ^{[4
]}

Tuza, Zs. ^{[2
,5
]}

机构：

[1] Univ Paris Sud, LRI, Bat 650, F-91405 Orsay, France

[2] Univ Pannonia, Dept Comp Sci & Syst Technol, Egyet U 10, H-8200 Veszprem, Hungary

[3] Univ Bonn, Dept Comp Sci, Friedrich Ebert Allee 144, D-53113 Bonn, Germany

[4] Univ Paris Est, LIGM, Bat Copern,5 Bd Descartes, F-77454 Marne La Vallee 2, France

[5] Hungarian Acad Sci, Alfred Renyi Inst Math, Realtanoda U 13-15, H-1053 Budapest, Hungary

来源：

JOURNAL OF DISCRETE ALGORITHMS | 2018年 / 48卷 / 27-41期

关键词：

Dominating set; Vertex-coloured graph; Approximation; Random graphs;

D O I：

10.1016/j.jda.2018.03.001

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a vertex-coloured graph, a dominating set is said to be tropical if every colour of the graph appears at least once in the set. Here, we study minimum tropical dominating sets from structural and algorithmic points of view. First, we prove that the tropical dominating set problem is NP-complete even when restricted to a simple path. Then, we establish upper bounds related to various parameters of the graph such as minimum degree and number of edges. We also give an optimal upper bound for random graphs. Last, we give approximability and inapproximability results for general and restricted classes of graphs, and establish a FPT algorithm for interval graphs. (C) 2018 Elsevier B.V. All rights reserved.

引用

页码：27 / 41

页数：15

共 50 条

[41] INTERIOR TOTAL DOMINATING SETS IN GRAPHS
Pacardo, Shiela Mae B.
Rara, Helen M.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2018, 19 (04): : 373 - 390
[42] On the number of fair dominating sets of graphs
Alikhani, Saeid
Safazadeh, Maryam
ADVANCED STUDIES-EURO-TBILISI MATHEMATICAL JOURNAL, 2023, 16 : 59 - 69
[43] Properties of partial dominating sets of graphs
Case, Benjamin M.
Fenstermacher, Todd
Ganguly, Soumendra
Laskar, Renu C.
arXiv, 2019,
[44] END SUPER DOMINATING SETS IN GRAPHS
Akbari, Saieed
Ghanbari, Nima
Henning, Michael A.
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2023,
[45] DISJOINT INDEPENDENT DOMINATING SETS IN GRAPHS
COCKAYNE, EJ
HEDETNIEMI, ST
DISCRETE MATHEMATICS, 1976, 15 (03) : 213 - 222
[46] Efficient dominating sets in Cayley graphs
Dejter, IJ
Serra, O
DISCRETE APPLIED MATHEMATICS, 2003, 129 (2-3) : 319 - 328
[47] Liar's dominating sets in graphs
Alimadadi, Abdollah
Chellali, Mustapha
Mojdeh, Doost Ali
DISCRETE APPLIED MATHEMATICS, 2016, 211 : 204 - 210
[48] Graphs with few total dominating sets
Krzywkowski, Marcin
Wagner, Stephan
DISCRETE MATHEMATICS, 2018, 341 (04) : 997 - 1009
[49] EQUITABLE RESOLVING DOMINATING SETS IN GRAPHS
Vaidya, S. K.
Kelaiya, J. B.
ADVANCES AND APPLICATIONS IN DISCRETE MATHEMATICS, 2023, 38 : 15 - 28
[50] Constructing Dominating Sets in Circulant Graphs
Igor E. Shparlinski
Annals of Combinatorics, 2018, 22 : 201 - 211

← 1 2 3 4 5 →