Results 41 to 50 of about 25,954 (258)
Signed total Roman domination in graphs
Journal of Combinatorial Optimization, 2015 Published by De Gruyter Open ...
L. Volkmann
semanticscholar +5 more sources
, 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 Filipović +2 more
openalex +4 more sources
Signed total double Roman dominating functions in graphs
AKCE International Journal of Graphs and CombinatoricsA signed total double Roman dominating function (STDRDF) on an isolated-free graph [Formula: see text] is a function [Formula: see text] such that (i) every vertex v with [Formula: see text] has at least two neighbors assigned 2 under f or one neighbor w
L. Shahbazi +2 more
doaj +2 more sources
Bounds on the total double Roman domination number of graphs [PDF]
Discussiones Mathematicae Graph Theory, 2021 Guoliang Hao +3 more
openalex +3 more sources
Several Roman domination graph invariants on Kneser graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2023 This paper considers the following three Roman domination graph invariants on Kneser graphs: Roman domination, total Roman domination, and signed Roman domination.
Tatjana Zec, Milana Grbić
doaj +1 more source
On the signed total Roman domination and domatic numbers of graphs
Discrete Applied Mathematics, 2016 Lutz Volkmann
openalex +2 more sources
On the total and strong version for Roman dominating functions in graphs [PDF]
Aequationes mathematicae, 2021 19 ...
S. Nazari-Moghaddam +3 more
openaire +3 more sources
Maximum Second Zagreb Index Of Trees With Given Roman Domination Number [PDF]
Transactions on Combinatorics, 2023 Chemical study regarding total $\pi$-electron energy with respect to conjugated molecules has focused on the second Zagreb index of graphs. Moreover, in the last half-century, it has gotten a lot of attention.
Ayu Ameliatul Ahmad Jamri +3 more
doaj +1 more source
Total restrained Roman domination
, 2022 Published by Azabaijan Shahid Madani University, Azarshahr ...
Amjadi, Jafar +2 more
openaire +2 more sources
Roman domination in direct product graphs and rooted product graphs
AIMS Mathematics, 2021 Let $ G $ be a graph with vertex set $ V(G) $. A function $ f:V(G)\rightarrow \{0, 1, 2\} $ is a Roman dominating function on $ G $ if every vertex $ v\in V(G) $ for which $ f(v) = 0 $ is adjacent to at least one vertex $ u\in V(G) $ such that $ f(u) = 2
Abel Cabrera Martínez +2 more
doaj +1 more source