Results 61 to 70 of about 7,761,342 (163)
Quasi total double Roman domination stability in graphs
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 [Formula: see text] if [Formula: see text], then the vertex v must have at least two neighbors ...
Saeed Kosari, Hanxin Jiang, M. Esmaeili
doaj +1 more source
The Geometric Themes in the Mosaics of the Religious Complex of Mértola (Portugal)
Journal of Mosaic Research, 2017 The Settlement of Mértola dates from at least the end of the second or early first millennium BC. In the so-called Iron Age, possibly in the third century BC, a walled enclosure with a total length of about 4 kilometres was constructed.
Virgílio António Martins LOPES
doaj +1 more source
Twin signed total Roman domination numbers in digraphs
, 2018 Let [Formula: see text] be a finite simple digraph with vertex set [Formula: see text] and arc set [Formula: see text]. A twin signed total Roman dominating function (TSTRDF) on the digraph [Formula: see text] is a function [Formula: see text ...
M. Soroudi, J. Amjadi
core +1 more source
The Signed Total Roman k-Domatic Number Of A Graph
Discussiones Mathematicae Graph Theory, 2017 Let k ≥ 1 be an integer. A signed total Roman k-dominating function on a graph G is a function f : V (G) → {−1, 1, 2} such that Ʃu2N(v) f(u) ≥ k for every v ∈ V (G), where N(v) is the neighborhood of v, and every vertex u ∈ V (G) for which f(u) = −1 is ...
Volkmann Lutz
doaj +1 more source
Ukrainian Greek Catholic (Uniate) Church: History, organization and political views [PDF]
BaštinaOne of the foundations of the modern Ukrainian nation is the Ukrainian Greek Catholic Church, which has been represented in the West of the country for almost half a milennium - ever since the decision on the church union of part of the local Ukrainian ...
Mijatović Marko R., Matić Petar M.
doaj +1 more source
The Forcing Domination Number of Hamiltonian Cubic Graphs [PDF]
, 2009 The authors presented a sequence of Hamiltonian cubic graphs whose domination numbers are sharp and in this paper we study forcing domination number for those ...
H. Abdollahzadeh Ahangar +3 more
core +1 more source
Perfect domination, Roman domination and perfect Roman domination in lexicographic product graphs
, 2022 The aim of this paper is to obtain closed formulas for the perfect dominationnumber, the Roman domination number and the perfect Roman domination number oflexicographic product graphs.
Garcia-Gomez, C. +5 more
core +1 more source
Algorithm aspect on total Roman $\{2\}$-domination number of Cartesian products of paths and cycles
, 2023 A total Roman {2}-dominating function (TR2DF) on a graph G with vertex set V is a function f : V → {0, 1, 2} having the property that for every vertex v with f(v) = 0, ∑u∈N (v) f(u) ≥ 2, where N(v) represents the open neighborhood of v, and the subgraph ...
Qin Chen
core +1 more source
Roman Domination Cover Rubbling [PDF]
, 2019 In this thesis, we introduce Roman domination cover rubbling as an extension of domination cover rubbling. We define a parameter on a graph $G$ called the \textit{Roman domination cover rubbling number}, denoted $\rho_{R}(G)$, as the smallest number of ...
Carney, Nicholas
core +1 more source
, 2016 For a graph (Formula presented.), a Roman dominating function (Formula presented.) has the property that every vertex (Formula presented.) with (Formula presented.) has a neighbor (Formula presented.) with (Formula presented.).
Haynes, Teresa W. +4 more
core +1 more source