Results 31 to 40 of about 700 (247)
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
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
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
Roman and Total Domination [PDF]
, 2015 A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination numberγt(G). A Roman dominating function on a graph G is a function
Haynes, Teresa W. +2 more
core +1 more source
Global total Roman domination in graphs [PDF]
, 2017 A total Roman dominating function (TRDF) on a graph [Formula: see text] is a function [Formula: see text] satisfying the conditions (i) every vertex [Formula: see text] for which [Formula: see text] is adjacent at least one vertex [Formula: see text ...
J. Amjadi +2 more
core +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
Diversity, 2023 Halmyris (Murighiol, Tulcea County, Romania) is one of the most important Roman settlements located in the inferior sector of the Danube Delta, in the easternmost part of Scythia province during the Late Antiquity.
Margareta Simina Stanc +4 more
doaj +1 more source
Quasi-total Roman Domination in Graphs [PDF]
, 2019 [EN] A quasi-total Roman dominating function on a graph G=(V,E) is a function f:V ->{0,1,2}satisfying the following: Every vertex for which u for which f(u) = 0 is adjacent to at least one vertex v for which f(v) = 2, and If x is an isolated vertex in ...
González Yero, Ismael +3 more
core +1 more source