
arXiv: 2406.11688
Given a function $f\colon V(G) \to \mathbb{Z}_{\geq 0}$ on a graph $G$, $AN(v)$ denotes the set of neighbors of $v \in V(G)$ that have positive labels under $f$. In 2021, Ahangar et al.~introduced the notion of $[k]$-Roman Dominating Function ([$k$]-RDF) of a graph $G$, which is a function $f\colon V(G) \to \{0,1,\ldots,k+1\}$ such that $\sum_{u \in N[v]}f(u) \geq k + |AN(v)|$ for all $v \in V(G)$ with $f(v)
19 pages
05C69, 05C99, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
05C69, 05C99, FOS: Mathematics, Mathematics - Combinatorics, Combinatorics (math.CO)
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
