Skip to main content Accessibility help

Domination problems on P5-free graphs

  • Min Chih Lin (a1) and Michel J. Mizrahi (a1)


The minimum roman dominating problem (denoted by γR(G), the weight of minimum roman dominating function of graph G) is a variant of the very well known minimum dominating set problem (denoted by γ(G), the cardinality of minimum dominating set of graph G). Both problems remain NP-Complete when restricted to P5-free graph class [A.A. Bertossi, Inf. Process. Lett. 19 (1984) 37–40; E.J. Cockayne, et al. Discret. Math. 278 (2004) 11–22]. In this paper we study both problems restricted to some subclasses of P5-free graphs. We describe robust algorithms that solve both problems restricted to (P5,(s,t)-net)-free graphs in polynomial time. This result generalizes previous works for both problems, and improves existing algorithms when restricted to certain families such as (P5,bull)-free graphs. It turns out that the same approach also serves to solve problems for general graphs in polynomial time whenever γ(G) and γR(G) are fixed (more efficiently than naive algorithms). Moreover, the algorithms described are extremely simple which makes them useful for practical purposes, and as we show in the last section it allows to simplify algorithms for significant classes such as cographs.



Hide All
[1] Bacso, G. and Tuza, Zs., Dominating cliques in P 5-free graphs. Period. Math. Hung. 21 (1990) 303308.
[2] Bertossi, A.A., Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19 (1984) 3740.
[3] Booth, K.S. and Howard Johnson, J., Dominating sets in chordal graphs. SIAM J. Comput. 11 (1982) 191199.
[4] Chang, Maw-Shang, Efficient algorithms for the domination problems on interval and circular-arc graphs. SIAM J. Comput. 27 (1998) 16711694.
[5] Chao, H.S., Hsu, Fang-Rong and C.T. Lee, Richard, An optimal algorithm for finding the minimum cardinality dominating set on permutation graphs. Discrete Appl. Math. 102 (2000) 159173.
[6] Chiba, N. and Nishizeki, T., Arboricity and subgraph listing algorithms. SIAM J. Comput. 14 (1985) 210223.
[7] Cockayne, E.J., Dreyer, P.A. Jr., Hedetniemi, S.M. and Hedetniemi, S.T., Roman domination in graphs. Discrete Math. 278 (2004) 1122.
[8] Cooper, C., Klasing, R. and Zito, M., Lower bounds and algorithms for dominating sets in web graphs. Internet Math. 2 (2005) 275300.
[9] Farber, M. and Mark Keil, J., Domination in permutation graphs. J. Algorithms 6 (1985) 309321.
[10] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Series of Books in Math. Sci. W.H. Freeman (1979).
[11] Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T. and Henning, M.A., Domination in graphs applied to electric power networks. SIAM J. Discrete Math. 15 (2002) 519529.
[12] T.W. Haynes, P.J. Slater and S.T. Hedetniemi, Fundamentals of domination in graphs. Includes bibliographical references and index (1998) 355–438.
[13] Kratsch, D., Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math. 99 (2000) 111123.
[14] Liedloff, M., Kloks, T., Liu, J., Peng, S.-L., Efficient algorithms for roman domination on some classes of graphs. Discrete Appl. Math. 156 (2008) 34003415.
[15] Müller, H. and Brandstädt, A., The np-completeness of steiner tree and dominating set for chordal bipartite graphs. Theoret. Comput. Sci. 53 (1987) 257265.
[16] Nicolai, F. and Szymczak, T., Homogeneous sets and domination: A linear time algorithm for distance – hereditary graphs. Networks 37 (2001) 117128.
[17] J. Wu and H. Li, Domination and its applications in ad hoc wireless networks with unidirectional links. In Proc. of International Conference on Parallel Processing (2000).
[18] Zverovich, I. E.. The domination number of (Kp, P5)-free graphs. Australas. J. Combin. 27 (2003) 95100.
Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

RAIRO - Theoretical Informatics and Applications
  • ISSN: 0988-3754
  • EISSN: 1290-385X
  • URL: /core/journals/rairo-theoretical-informatics-and-applications
Please enter your name
Please enter a valid email address
Who would you like to send this to? *



Full text views

Total number of HTML views: 0
Total number of PDF views: 0 *
Loading metrics...

Abstract views

Total abstract views: 0 *
Loading metrics...

* Views captured on Cambridge Core between <date>. This data will be updated every 24 hours.

Usage data cannot currently be displayed