Signed Roman K-Domination in Graphs

Michael A. Henning, Lutz Volkmann

Research output: Contribution to journalArticlepeer-review

27 Citations (Scopus)


Let (Formula presented.) be an integer, and let (Formula presented.) be a finite and simple graph with vertex set (Formula presented.). A signed Roman (Formula presented.)-dominating function (SRkDF) on a graph (Formula presented.) is a function (Formula presented.) satisfying the conditions that (i)(Formula presented.) for each vertex (Formula presented.), where (Formula presented.) is the closed neighborhood of (Formula presented.), and (ii) every vertex(Formula presented.) for which (Formula presented.) is adjacent to at least one vertex (Formula presented.) for which (Formula presented.). The weight of an SRkDF(Formula presented.) is (Formula presented.). The signed Roman (Formula presented.)-domination number (Formula presented.) of (Formula presented.) is the minimum weight of an (Formula presented.) on (Formula presented.). In this paper we initiate the study of the signed Roman (Formula presented.)-domination number of graphs, and we present different bounds on (Formula presented.). In addition, we determine the signed Roman $$k$$k-domination number of some classes of graphs. Some of our results are extensions of well-known properties of the signed Roman domination number (Formula presented.), introduced and investigated by Ahangar et al. (J Comb Optim doi:10.1007/s10878-012-9500-0, 2014).

Original languageEnglish
Pages (from-to)175-190
Number of pages16
JournalGraphs and Combinatorics
Issue number1
Publication statusPublished - 1 Jan 2016


  • Signed Roman k-dominating function
  • Signed Roman k-domination number

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics


Dive into the research topics of 'Signed Roman K-Domination in Graphs'. Together they form a unique fingerprint.

Cite this