Results 41 to 50 of about 839 (260)
Bounds on signed total double Roman domination [PDF]
Communications in Combinatorics and Optimization, 2020 A signed total double Roman dominating function (STDRDF) on {an} isolated-free graph $G=(V,E)$ is a function $f:V(G)\rightarrow\{-1,1,2,3\}$ such that (i) every vertex $v$ with $f(v)=-1$ has at least two neighbors assigned 2 under $f$ or one neighbor ...
L. Shahbazi +3 more
doaj +1 more source
Total Roman domination subdivision number in graphs [PDF]
Communications in Combinatorics and Optimization, 2020 A {\em Roman dominating function} on a graph $G$ is a function $f:V(G)\rightarrow \{0,1,2\}$ satisfying the condition that every vertex $u$ for which $f(u)=0$ is adjacent to at least one vertex $v$ for which $f(v)=2$.
Jafar Amjad
doaj +1 more source
Maximum Second Zagreb Index Of Trees With Given Roman Domination Number [PDF]
Transactions on Combinatorics, 2023 Chemical study regarding total $\pi$-electron energy with respect to conjugated molecules has focused on the second Zagreb index of graphs. Moreover, in the last half-century, it has gotten a lot of attention.
Ayu Ameliatul Ahmad Jamri +3 more
doaj +1 more source
Total Roman {2}-domination in graphs [PDF]
Quaestiones Mathematicae, 2019 Given a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2\}$ is a total Roman $\{2\}$-dominating function if: (1) every vertex $v\in V$ for which $f(v)=0$ satisfies that $\sum_{u\in N(v)}f(u)\geq 2$, where $N(v)$ represents the open neighborhood of $v$, and (2) every vertex $x\in V$ for which $f(x)\geq 1$ is adjacent to at least one vertex $y\in V ...
Suitberto Cabrera García +3 more
openaire +3 more sources
On Roman, Global and Restrained Domination in Graphs [PDF]
, 2010 In this paper, we present new upper bounds for the global domination and Roman domination numbers and also prove that these results are asymptotically best possible.
Zverovich, Vadim +3 more
core +2 more sources
Total roman domination in digraphs [PDF]
, 2021 Let D be a nite and simple digraph with vertex set V (D). A Roman dominating function (RDF) on a digraph D is a function f : V (D) → {0; 1; 2} satisfying the condition that every vertex v with f(v) = 0 has an in-neighbor u with f(u) = 2. The weight of an
Zhuang, Wei, Hu, Kangxiu, Hao, Guoliang
core
Analysis of the presence of Eastern elements in Frankenstien Mary Shelly [PDF]
ادبیات تطبیقی, 2021 1. Introduction The valuable Frankenstein or Modern Prometheus novel written by Mary Shelley in the early nineteenth century is a Gothic-style science-fiction.
Najmeh Dorri, Shabnam Amiri
doaj +1 more source
Total Roman Domination of Kneser Graphs [PDF]
, 2023 The total Roman domination number of a graph is the smallest possible sum of the weights 0, 1, and 2 applied to vertices of the graph that satisfy certain rules originating from Roman military strategy.
Stainsby, Cole +6 more
core
Total Protection of Lexicographic Product Graphs
Discussiones Mathematicae Graph Theory, 2022 Given a graph G with vertex set V (G), a function f : V (G) → {0, 1, 2} is said to be a total dominating function if Σu∈N(v) f(u) > 0 for every v ∈ V (G), where N(v) denotes the open neighbourhood of v. Let Vi = {x ∈ V (G) : f(x) = i}. A total dominating
Martínez Abel Cabrera +1 more
doaj +1 more source
Relating the Outer-Independent Total Roman Domination Number with Some Classical Parameters of Graphs [PDF]
, 2022 For a given graph G without isolated vertex we consider a function f : V (G) -> {0,1, 2}. For every i is an element of {0,1, 2}, let V-i = {v is an element of V (G) : f (v) = i}.
González Yero, Ismael +2 more
core +1 more source