Results 21 to 30 of about 14,901,088 (199)
Quasi-total Roman reinforcement in graphs
AKCE International Journal of Graphs and Combinatorics, 2023 A quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isolated vertex ...
N. Ebrahimi +3 more
doaj +1 more source
Quasi-total Roman bondage number in graphs
AKCE International Journal of Graphs and Combinatorics, 2022 A quasi-total Roman dominating function (QTRD-function) on [Formula: see text] is a function [Formula: see text] such that (i) every vertex x for which f(x) = 0 is adjacent to at least one vertex v for which f(v) = 2, and (ii) if x is an isolated vertex ...
Huiqin Jiang, Zehui Shao
doaj +1 more source
On the signed strong total Roman domination number of graphs
Tamkang Journal of Mathematics, 2022 Let $G=(V,E)$ be a finite and simple graph of order $n$ and maximumdegree $\Delta$. A signed strong total Roman dominating function ona graph $G$ is a function $f:V(G)\rightarrow\{-1, 1,2,\ldots, \lceil\frac{\Delta}{2}\rceil+1\}$ satisfying the condition that (i) forevery vertex $v$ of $G$, $f(N(v))=\sum_{u\in N(v)}f(u)\geq 1$, where$N(v)$ is the open ...
Mahmoodi, A., Atapour, M., Norouzian, S.
openaire +1 more source
On the total Roman domination stability in graphs
AKCE International Journal of Graphs and Combinatorics, 2021 A total Roman dominating function on a graph G is a function satisfying the conditions: (i) every vertex u with f(u) = 0 is adjacent to at least one vertex v of G for which f(v) = 2; (ii) the subgraph induced by the vertices assigned non-zero values has ...
Ghazale Asemian +3 more
doaj +1 more source
Total Roman domination on the digraphs
Open Mathematics, 2023 Let D=(V,A)D=\left(V,A) be a simple digraph with vertex set VV, arc set AA, and no isolated vertex. A total Roman dominating function (TRDF) of DD is a function h:V→{0,1,2}h:V\to \left\{0,1,2\right\}, which satisfies that each vertex x∈Vx\in V with h(x ...
Zhang Xinhong, Song Xin, Li Ruijuan
doaj +1 more source
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
Singed Total Domatic Number of a Graph [PDF]
, 2010 The maximum number of functions in a signed total dominating family on G is the signed total domatic number of G. In this paper, some properties related signed total domatic number and signed total domination number of a graph are studied and found the ...
Shailaja S. Shirkol +2 more
core +1 more source
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 +1 more source
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
Triple Connected Domination Number of a Graph [PDF]
, 2012 The concept of triple connected graphs with real life application was introduced by considering the existence of a path containing any three vertices of a graph G.
Selvam Avadayappan +7 more
core +1 more source