On the Number of Minimal Dominating Sets on Cobipartite and Interval Graphs

Abstract : A dominating set in a graph is a subset of vertices such that each vertex is either in the dominating set or adjacent to some vertex in the dominating set. It is known that graphs have at most O(1.7159^n) minimal dominating sets. Here we establish upper bounds on this maximum number of minimal dominating sets for cobipartite and interval graphs. For each of these graph classes, we provide an algorithm to enumerate them. For interval graphs, we show that the number of minimal dominating sets is at most 3^{n/3} \approx 1.4423^n, which is the best possible bound. For cobipartite graphs, we lower the O(1.5875^n) upper bound from Couturier et al. to O(1.4511^n).
Type de document :
Communication dans un congrès
9th International colloquium on graph theory and combinatorics, Jun 2014, Grenoble, France. 2014
Liste complète des métadonnées

https://hal.archives-ouvertes.fr/hal-01105090
Contributeur : Mathieu Liedloff <>
Soumis le : lundi 19 janvier 2015 - 16:58:00
Dernière modification le : jeudi 17 janvier 2019 - 15:10:02

Identifiants

  • HAL Id : hal-01105090, version 1

Citation

Jean-François Couturier, Romain Letourneur, Mathieu Liedloff. On the Number of Minimal Dominating Sets on Cobipartite and Interval Graphs. 9th International colloquium on graph theory and combinatorics, Jun 2014, Grenoble, France. 2014. 〈hal-01105090〉

Partager

Métriques

Consultations de la notice

126