Global Weak Roman Domination in Graphs
Journal of Mathematical Sciences and Informatics · 01.04.2026 · 21 (1) · 217-228
DOI: 10.66224/ijmsi.21.1.217 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Mathematical Sciences and Informatics, online erschienen am 01.04.2026. Verfasst von P. Roushini Leely Pushpam und 1 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben.
Abstract (Originalsprache)
A Roman dominating function (RDF) of a graph G = (V, E) is a function f : V (G) → {0, 1, 2} satisfying the condition that every vertex u for which f (u) = 0 is adjacent to at least one vertex v for whichv}, has no undefended vertex.The weight of f is defined to be the value f (V ) = u∈V f (u).The minimum weight of a weak Roman dominating function of a graph G is called the weak Roman domination number of G and is denoted byγrcardinality of a global dominating set S. We extend the idea of global domination to weak Roman domination as follows: For a graphThe weight of a global weak Roman dominating function is the valueu∈V f (u).The minimum weight of a global weak Roman
Zitieren
APA
Pushpam, P. R. L., & Srilakshmi, N. (2026). Global Weak Roman Domination in Graphs. Journal of Mathematical Sciences and Informatics, 21(1), 217-228. https://doi.org/10.66224/ijmsi.21.1.217
Vancouver
Pushpam PRL, Srilakshmi N. Global Weak Roman Domination in Graphs. Journal of Mathematical Sciences and Informatics. 2026;21(1):217-228. doi:10.66224/ijmsi.21.1.217
BibTeX
@article{Pushpam2026,
author = {Pushpam, P. Roushini Leely and Srilakshmi, N.},
title = {Global Weak Roman Domination in Graphs},
journal = {Journal of Mathematical Sciences and Informatics},
year = {2026},
volume = {21},
number = {1},
pages = {217--228},
doi = {10.66224/ijmsi.21.1.217}
}
EUVIMED