Results 1 to 10 of about 670,635 (308)
Roman domination excellent graphs: trees
Communications in Combinatorics and Optimization, 2016 A Roman dominating function (RDF) on a graph $G = (V, E)$ is a labeling $f : V \rightarrow \{0, 1, 2\}$ such that every vertex with label $0$ has a neighbor with label $2$. The weight of $f$ is the value $f(V) = _{v\in V} f(v)$. The Roman domination number, $ _R(G)$, of $G$ is the minimum weight of an RDF on $G$. An RDF of minimum weight is called a
openaire +4 more sources
On the Independent Double Roman Domination in Graphs [PDF]
, 2019 Doost Ali Mojdeh, Zhila Mansouri
openalex +1 more source
Reconceptualizing solidarity as power from below. [PDF]
Philos Stud, 2023 Zheng R.
europepmc +1 more source
Warm Soil, Westerly Wind, and Wet Feet: Feeling and Measuring Ecological Time in the Roman World. [PDF]
Geohealth, 2023 Tally-Schumacher KJ.
europepmc +1 more source
On Roman, Global and Restrained Domination in Graphs
, 2009 Anush Poghosyan, Vadim Zverovich
openalex +2 more sources
On the signed strong total Roman domination number of graphs
, 2022 A. Mahmoodi +2 more
openalex +2 more sources
Computing locating-total domination number in some rotationally symmetric graphs. [PDF]
Sci Prog, 2021 Raza H, Iqbal N, Khan H, Botmart T.
europepmc +1 more source