Results 211 to 220 of about 48,400 (246)
Some of the next articles are maybe not open access.
Signed total Roman domination and domatic numbers in graphs
Applied Mathematics and ComputationYubao Guo, Lutz Volkmann, Yun Wang
openaire +3 more sources
Signed total Roman domination in graphs
Journal of Combinatorial Optimization, 2015L. Volkmann
semanticscholar +3 more sources
Bounds on the signed total Roman 2-domination in graphs
Discret. Math. Algorithms Appl., 2020Let [Formula: see text] be an integer and [Formula: see text] be a simple and finite graph with vertex set [Formula: see text]. A signed total Roman [Formula: see text]-dominating function (STR[Formula: see text]DF) on a graph [Formula: see text] is a ...
R. Khoeilar +3 more
semanticscholar +1 more source
Signed total double Roman k-domination in graphs
Discret. Math. Algorithms Appl., 2019A signed total double Roman [Formula: see text]-dominating function (STDRkDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex [Formula: see text] with [Formula: see text] has at least two ...
L. Shahbazi +3 more
semanticscholar +1 more source
Exploring Variant Roman Domination Number in Complete Binary Trees Using Python Programming
2024 International Conference on Sustainable Communication Networks and Application (ICSCNA)A Roman Dominating Function (RDF) on a graph $G$ is defined as a function $g$ that assigns a value of 0, 1, or 2 to each vertex in such a way that any vertex assigned a value of 0 is adjacent to at least one vertex assigned a value of 2. The total weight
J. Meena, T. Mai
semanticscholar +1 more source
The signed Roman domination number of two classes graphs
Discret. Math. Algorithms Appl., 2020Let G = (V,E) be a simple graph with vertex set V and edge set E. A signed Roman dominating function (SRDF) of G is a function f:V ↦{−1, 1, 2} satisfying the conditions that (i) ∑x′∈N[x]f(x′) ≥ 1 f...
Xia Hong +3 more
semanticscholar +1 more source
On the signed strong Roman domination number of graphs
Discret. Math. Algorithms Appl., 2020Let G = (V,E) be a finite and simple graph of order n and maximum degree Δ. A signed strong Roman dominating function on a graph G is a function f : V (G) →{−1, 1, 2,…,⌈Δ 2 ⌉ + 1} satisfying the co...
A. Mahmoodi
semanticscholar +1 more source
On the outer-independent total (Roman) domination number of some graph operators
RAIRO - Operations ResearchThe goal of this article is to obtain closed formulas for the outer-independent total domination number and the outer-independent total Roman domination number of the following well-known graph operators defined from a connected graph $G$: the central ...
Ismael Rios-Villamar +2 more
semanticscholar +1 more source
Bounds on the quasi total double Roman domination number in graphs
Discrete Mathematics, Algorithms and Applications (DMAA)A 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 [Formula: see text], then vertex [Formula: see text] must have at least two neighbors ...
J. Amjadi +4 more
semanticscholar +1 more source
Lower Bounds on Signed Total Double Roman k-domination in Graphs
Journal of Mathematical Sciences and Informatics.
L. Shahbazi +3 more
semanticscholar +1 more source