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 条

[1] Vertex Cover Hop Dominating Sets in Graphs
Bilar, Vergel T.
Bonsocan, Maria Andrea O.
Hassan, Javier A.
Dagondon, Susan C.
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS, 2024, 17 (01): : 93 - 104
[2] Graphs with unique minimum vertex-edge dominating sets
Senthilkumar, B.
Chellali, M.
Naresh Kumar, H.
Venkatakrishnan, Yanamandram B.
RAIRO-OPERATIONS RESEARCH, 2023, 57 (04) : 1785 - 1795
[3] Graphs with unique minimum edge-vertex dominating sets
Senthilkumar, B.
Chellali, M.
Kumar, H. Naresh
Venkatakrishnan, Y. B.
COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2025, 10 (01) : 99 - 109
[4] Dominating Sets and Connected Dominating Sets in Dynamic Graphs
Hjuler, Niklas
Italiano, Giuseppe F.
Parotsidis, Nikos
Saulpic, David
36TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE (STACS 2019), 2019,
[5] On dominating sets and independent sets of graphs
Harant, J
Pruchnewski, A
Voigt, M
COMBINATORICS PROBABILITY & COMPUTING, 1999, 8 (06): : 547 - 553
[6] EDGE DOMINATING SETS AND VERTEX COVERS
Dutton, Ronald
Klostermeyer, William F.
DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2013, 33 (02) : 437 - 456
[7] Disjoint dominating and total dominating sets in graphs
Henning, Michael A.
Loewenstein, Christian
Rautenbach, Dieter
Southey, Justin
DISCRETE APPLIED MATHEMATICS, 2010, 158 (15) : 1615 - 1623
[8] Vertex covers and eternal dominating sets
Klostermeyer, William F.
Mynhardt, C. M.
DISCRETE APPLIED MATHEMATICS, 2012, 160 (7-8) : 1183 - 1190
[9] Super Dominating Sets in Graphs
M. Lemańska
V. Swaminathan
Y. B. Venkatakrishnan
R. Zuazua
Proceedings of the National Academy of Sciences, India Section A: Physical Sciences, 2015, 85 : 353 - 357
[10] EDGE DOMINATING SETS IN GRAPHS
YANNAKAKIS, M
GAVRIL, F
SIAM JOURNAL ON APPLIED MATHEMATICS, 1980, 38 (03) : 364 - 372

← 1 2 3 4 5 →