Signed total Roman domination and domatic numbers in graphs

Yubao Guo, Lutz Volkmann and Yun Wang

Applied Mathematics and Computation, 2025, vol. 487, issue C

Abstract: A signed total Roman dominating function (STRDF) on a graph G is a function f:V(G)⟶{−1,1,2} satisfying (i) ∑x∈NG(u)f(x)≥1 for each vertex u∈V(G) and its neighborhood NG(u) in G and, (ii) every vertex u∈V(G) with f(u)=−1, there exists a vertex v∈NG(u) with f(v)=2. The minimum number ∑u∈V(G)f(u) among all STRDFs f on G is denoted by γstR(G). A set {f1,…,fd} of distinct STRDFs on G is called a signed total Roman dominating family on G if ∑i=1dfi(u)≤1 for each u∈V(G). We use dstR(G) to denote the maximum number of functions among all signed total Roman dominating families on G. Our purpose in this paper is to examine the effects on γstR(G) when G is modified by removing or subdividing an edge. In addition, we determine the number dstR(G) for the case that G is a complete graph or bipartite graph.

Keywords: Signed total Roman dominating functions; Signed total Roman domination number; Signed total Roman domatic (search for similar items in EconPapers)
Date: 2025
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324005356
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:487:y:2025:i:c:s0096300324005356

DOI: 10.1016/j.amc.2024.129074

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().