The signed Roman domination number of Ladder graphs and their complements
Journal of Combinatorial Mathematics and Combinatorial Computing · 22.07.2026 · 131 · 161-182
DOI: 10.61091/jcmcc131-09 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Combinatorial Mathematics and Combinatorial Computing, online erschienen am 22.07.2026. Verfasst von Dilbak Haje und 3 weiteren Autor:innen.
Abstract (Originalsprache)
A signed Roman dominating function (SRDF) on \(G=(V,E)\), a finite, connected, simple graph is a mapping \(f : V \to \{-1, 1, 2\},\) such that
(a) For every vertex \(x \in V\), \(\sum\limits_{y \in N[x]} f(y) \ge 1,\) where \(N[x]\) denotes the closed neighborhood of \(x\), consisting of \(x\) together with all vertices adjacent to \(x\).
(b) Every vertex \(x \in V\) with \(f(x) = -1\) is adjacent to at least one vertex \(y \in V\) such that \(f(y) = 2\).
The weight of an SRDF is defined as \(\sum\limits_{v \in V(G)} f(v)\). The signed Roman domination number (SRDN) of \(G\), denoted by \(\gamma_{SR}(G)\), is the minimum possible weight among all signed Roman dominating functions on \(G\). In this work, we determine the signed Roman domination number of the ladder graph \(LG_n\) and its complement \(LG_n^c\).
Zitieren
APA
Haje, D., Ahmed, D., Izanloo, H., & Saikia, M. (2026). The signed Roman domination number of Ladder graphs and their complements. Journal of Combinatorial Mathematics and Combinatorial Computing, 131, 161-182. https://doi.org/10.61091/jcmcc131-09
Vancouver
Haje D, Ahmed D, Izanloo H, Saikia M. The signed Roman domination number of Ladder graphs and their complements. Journal of Combinatorial Mathematics and Combinatorial Computing. 2026;131:161-182. doi:10.61091/jcmcc131-09
BibTeX
@article{Haje2026,
author = {Haje, Dilbak and Ahmed, Delbrin and Izanloo, Hassan and Saikia, Manjil},
title = {The signed Roman domination number of Ladder graphs and their complements},
journal = {Journal of Combinatorial Mathematics and Combinatorial Computing},
year = {2026},
volume = {131},
pages = {161--182},
doi = {10.61091/jcmcc131-09}
}
EUVIMED