The Algorithmic Complexity of k-Domatic Partition of Graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2012

The Algorithmic Complexity of k-Domatic Partition of Graphs

(1)
1
Hongyu Liang
  • Function : Author
  • PersonId : 1011792

Abstract

Let G = (V,E) be a simple undirected graph, and k be a positive integer. A k-dominating set of G is a set of vertices S ⊆ V satisfying that every vertex in V ∖ S is adjacent to at least k vertices in S. A k-domatic partition of G is a partition of V into k-dominating sets. The k-domatic number of G is the maximum number of k-dominating sets contained in a k-domatic partition of G. In this paper we study the k-domatic number from both algorithmic complexity and graph theoretic points of view. We prove that it is $\mathcal{NP}$-complete to decide whether the k-domatic number of a bipartite graph is at least 3, and present a polynomial time algorithm that approximates the k-domatic number of a graph of order n within a factor of $(\frac{1}{k}+o(1))\ln n$, generalizing the (1 + o(1))ln n approximation for the 1-domatic number given in [5]. In addition, we determine the exact values of the k-domatic number of some particular classes of graphs.
Fichier principal
Vignette du fichier
978-3-642-33475-7_17_Chapter.pdf (119.87 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01556216 , version 1 (04-07-2017)

Licence

Attribution - CC BY 4.0

Identifiers

Cite

Hongyu Liang. The Algorithmic Complexity of k-Domatic Partition of Graphs. 7th International Conference on Theoretical Computer Science (TCS), Sep 2012, Amsterdam, Netherlands. pp.240-249, ⟨10.1007/978-3-642-33475-7_17⟩. ⟨hal-01556216⟩
36 View
149 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More