Results 41 to 50 of about 7,761,342 (163)
Roman Edge Semi-Total Block Domination of a Graph
Asia Pacific Journal of Mathematics, 2018 Summary: A graph \(G=(V,E)\), semi-total block graph \(T_b(G)=H\), whose set of vertices is the union of the set of vertices and blocks of \(G\) in whose two vertices are adjacent if and only if the corresponding vertices and blocks of \(G\) are adjacent or the corresponding members are incident.
Girish V.R., P. Usha
doaj +3 more sources
Total Roman {3}-Domination: The Complexity and Linear-Time Algorithm for Trees
Mathematics, 2021 For a simple graph G=(V,E) with no isolated vertices, a total Roman {3}-dominating function(TR3DF) on G is a function f:V(G)→{0,1,2,3} having the property that (i) ∑w∈N(v)f(w)≥3 if f(v)=0; (ii) ∑w∈N(v)f(w)≥2 if f(v)=1; and (iii) every vertex v with f(v ...
Xinyue Liu +3 more
doaj +1 more source
Total restrained Roman domination
, 2022 Published by Azabaijan Shahid Madani University, Azarshahr ...
Amjadi, Jafar +2 more
openaire +3 more sources
Total Roman domination edge-critical graphs [PDF]
Involve, a Journal of Mathematics, 2019 A total Roman dominating function on a graph $G$ is a function $% f:V(G)\rightarrow \{0,1,2\}$ such that every vertex $v$ with $f(v)=0$ is adjacent to some vertex $u$ with $f(u)=2$, and the subgraph of $G$ induced by the set of all vertices $w$ such that $f(w)>0$ has no isolated vertices. The weight of $f$ is $Σ_{v\in V(G)}f(v)$.
Lampman, Chloe +2 more
openaire +4 more sources
Total roman domination in digraphs
, 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
Total Roman Domination of Kneser Graphs
, 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
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
CoRR, 2022 In this paper we deal with the signed Roman domination and signed total Roman domination problems. For each problem we propose two integer linear programming (ILP) formulations, the constraint programming (CP) formulation and variable neighborhood search (VNS) method.
Vladimir Filipovic +2 more
openaire +2 more sources
Total Roman domination in graphs
Applicable Analysis and Discrete Mathematics, 2016 A Roman dominating function on a graph G is a function f:V(G) → {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. The weight of a Roman dominating function f is the sum, ΣuV(G) f(u), of the weights of the vertices.
Hossein Ahangar Abdollahzadeh +3 more
openaire +2 more sources
Total Roman 2-Reinforcement of Graphs
Journal of Mathematics, 2021 A total Roman 2-dominating function (TR2DF) on a graph Γ=V,E is a function l:V⟶0,1,2, satisfying the conditions that (i) for every vertex y∈V with ly=0, either y is adjacent to a vertex labeled 2 under l, or y is adjacent to at least two vertices labeled
M. Kheibari +3 more
doaj +1 more source