Roman Domination over Some Graph Classes

  • Mathieu Liedloff
  • Ton Kloks
  • Jiping Liu
  • Sheng-Lung Peng
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3787)


A Roman dominating function of a graph G = (V,E) is a function f : V → {0,1,2} such that every vertex x with f(x) = 0 is adjacent to at least one vertex y with f(y) = 2. The weight of a Roman dominating function is defined to be f(V) = ∑ x ∈ V f(x), and the minimum weight of a Roman dominating function on a graph G is called the Roman domination number of G.

In this paper we answer an open problem mentioned in [2] by showing that the Roman domination number of an interval graph can be computed in linear time. We also show that the Roman domination number of a cograph can be computed in linear time. Besides, we show that there are polynomial time algorithms for computing the Roman domination numbers of AT-free graphs and graphs with a d-octopus.


Time Algorithm Discrete Math Interval Graph Domination Number Linear Time Algorithm 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Brändstadt, A., Le, V., Spinrad, J.P.: Graph classes: A survey. SIAM Monogr. Discrete Math. Appl., Philadelphia (1999)Google Scholar
  2. 2.
    Cockayne, E.J., Dreyer Jr., P.A., Hedetniemi, S.M., Hedetniemi, S.T.: Roman domination in graphs. Discrete Math. 278, 11–22 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  3. 3.
    Corneil, D.G., Olariu, S., Stewart, L.: Linear time algorithms for dominating pairs in asteroidal triple-free graphs. SIAM J. Comput. 28, 1284–1297 (1999)zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Corneil, D.G., Olariu, S., Stewart, L.: Asteroidal triple-free graphs. SIAM J. Discrete Math. 10, 399–430 (1997)zbMATHCrossRefMathSciNetGoogle Scholar
  5. 5.
    Deogun, J.S., Kratsch, D.: Diametral path graphs. In: Nagl, M. (ed.) WG 1995. LNCS, vol. 1017, pp. 344–357. Springer, Heidelberg (1995)Google Scholar
  6. 6.
    Fernau, H.: Roman domination: a parameterized perspective (Manuscript)Google Scholar
  7. 7.
    Fomin, F.V., Kratsch, D., Müller, H.: Algorithms for graphs with small octopus. Discrete Appl. Math. 134, 105–128 (2004)zbMATHCrossRefMathSciNetGoogle Scholar
  8. 8.
    Golumbic, M.C.: Algorithmic graph theory and perfect graphs. Academic Press, New York (1980)zbMATHGoogle Scholar
  9. 9.
    Habib, M., Paul, C.: A simple linear time algorithm for cograph recognition. Discrete Appl. Math. 145, 183–197 (2005)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Henning, M.A.: A characterization of Roman trees. Discuss. Math. Graph Theory 22, 225–234 (2002)Google Scholar
  11. 11.
    Henning, M.A.: Defending the Roman empire from multiple attacks. Discrete Math. 271, 101–115 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  12. 12.
    Henning, M.A., Hedetniemi, S.T.: Defending the Roman empire–A new strategy. Discrete Math. 266, 239–251 (2003)zbMATHCrossRefMathSciNetGoogle Scholar
  13. 13.
    Kloks, T., Liedloff, M., Liu, J., Peng, S.L.: Roman domination in some special classes of graphs, Technical Report TR-MA-04-01, University of Lethbridge, Alberta, Canada (November 2004)Google Scholar
  14. 14.
    Kratsch, D.: Domination and total domination on asteroidal triple-free graphs. Discrete Appl. Math. 99, 111–123 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Pagourtzis, A., Penna, P., Schlude, K., Steinhöfel, K., Taylor, D.S., Widmayer, P.: Server placements, Roman domination and other dominating set variants. In: IFIP TCS Conference Proceedings, vol. 271, pp. 280–291 (2002)Google Scholar
  16. 16.
    ReVelle, C.S., Rosing, K.E.: Defenders imperium Romanum: A classical problem in military strategy. Amer. Math. Monthly 107, 585–594 (2000)zbMATHCrossRefMathSciNetGoogle Scholar
  17. 17.
    Stewart, I.: Defend the Roman empire! Sci. Amer. 281, 136–139 (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Mathieu Liedloff
    • 1
  • Ton Kloks
    • 1
  • Jiping Liu
    • 2
  • Sheng-Lung Peng
    • 3
  1. 1.Laboratoire d’Informatique Théorique et AppliquéeUniversité Paul Verlaine – MetzMetzFrance
  2. 2.Department of Mathematics and Computer ScienceThe university of LethbridgeAlbertaCanada
  3. 3.Department of Computer Science and Information EngineeringNational Dong Hwa UniversityHualienTaiwan, R.O.C

Personalised recommendations