Results 11 to 20 of about 123,660 (292)
On the Quasi-Total Roman Domination Number of Graphs [PDF]
Mathematics, 2021 Domination theory is a well-established topic in graph theory, as well as one of the most active research areas. Interest in this area is partly explained by its diversity of applications to real-world problems, such as facility location problems ...
Abel Cabrera Martínez +2 more
doaj +3 more sources
On the total Roman domination stability in graphs [PDF]
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 +3 more sources
Total Roman domination edge-critical graphs [PDF]
Involve, a Journal of Mathematics, 2019 15 pages, 2 ...
Chloe Lampman +2 more
semanticscholar +8 more sources
Quasi-total Roman domination in graphs [PDF]
Results in Mathematics, 2019 15 ...
Suitberto Cabrera-Garcia +2 more
semanticscholar +10 more sources
Total Roman Domination Number of Rooted Product Graphs [PDF]
Mathematics, 2020 Let G be a graph with no isolated vertex and f:V(G)→{0,1,2} a function. If f satisfies that every vertex in the set {v∈V(G):f(v)=0} is adjacent to at least one vertex in the set {v∈V(G):f(v)=2}, and if the subgraph induced by the set {v∈V(G):f(v)≥1} has ...
Abel Cabrera Martínez +3 more
doaj +3 more sources
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 +3 more sources
On the Total Double Roman Domination [PDF]
IEEE Access, 2019 Let G = (V, E) be a simple graph. A double Roman dominating function (DRDF) on G is a function f from the vertex set V of G into {0, 1, 2, 3} such that if f (u) = 0, then u must have at least two neighbors assigned 2 or one neighbor assigned 3 under f ...
Zehui Shao +3 more
doaj +3 more sources
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 +4 more sources
Quasi total double Roman domination in graphs [PDF]
AKCE International Journal of Graphs and CombinatoricsA quasi total double Roman dominating function (QTDRD-function) on a graph [Formula: see text] is a function [Formula: see text] having the property that (i) if f(v) = 0, then vertex v must have at least two neighbors assigned 2 under f or one neighbor w
S. Kosari +4 more
doaj +3 more sources
Computational Complexity of Outer-Independent Total and Total Roman Domination Numbers in Trees
IEEE Access, 2018 An outer-independent total dominating set (OITDS) of a graph G is a set D of vertices of G such that every vertex of G has a neighbor in D, and the set V (G) \ D is independent.
Zepeng Li +4 more
doaj +3 more sources