Results 51 to 60 of about 10,626,776 (155)
Impact of Some Graph Operations on Double Roman Domination Number
, 2019 Given a graph $G=(V,E)$, a function $f:V\rightarrow \{0,1,2,3\}$ having the property that if $f(v)=0$, then there exist $ v_{1},v_{2}\in N(v)$ such that $f(v_{1})=f(v_{2})=2$ or there exists $ w \in N(v)$ such that $f(w)=3$, and if $f(v)=1$, then there exists $ w \in N(v)$ such that $f(w)\geq 2$ is called a double Roman dominating function (DRDF).
V., Anu, S., Aparna Lakshmanan
openaire +2 more sources
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 restrained double Roman domination and graph operations
A restrained double Roman dominating function (RDRD-function) on a graph G is a function f:V(G)→{0, 1, 2, 3} that satisfies two conditions: (1) If f(v)
Yue, Jun, Gao, Zhipeng, Xi, Changqing
core +3 more sources
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 domination number, the Roman domination number and the perfect Roman domination number of lexicographic product graphs.
Cabrera Martinez, A.; Garcia-Gomez, C.; Rodriguez-Velazquez, J. A.;
core +1 more source
Roman Domination in Weighted Graphs
MathematicsA Roman dominating function for a (non-weighted) graph G=(V,E) is a function f:V→{0,1,2} such that every vertex u∈V with f(u)=0 has at least one neighbor v∈V such that f(v)=2.
Martín Cera +2 more
doaj +1 more source
Trees with vertex-edge Roman Domination number twice the domination number minus one
, 2020 A vertex-edge Roman dominating function (or just ve-RDF) of a graph G = (V, E) is a function f : V (G) → {0, 1, 2} such that for each edge e = uv either max{f (u), f (v)} ≠ 0 or there exists a vertex w such that either wu ∈ E or wv ∈ E and f (w) = 2. The
Venkatakrishnan, Y. B., Naresh Kumar, H.
core +1 more source
Domination Analysis of Greedy Heuristics For The Frequency Assignment Problem [PDF]
, 2003 We introduce the greedy expectation algorithm for the fixed spectrum version of the frequency assignment problem. This algorithm was previously studied for the travelling salesman problem.
Noble, SD +6 more
core +1 more source
, 2014 V diplomskem delu je predstavljena t.i. rimska dominacija, gre za eno izmed različic običajne dominacije. V prvem delu so na kratko povzeti osnovni pojmi iz teorije grafov. V nadaljevanju govorimo o značilnostih dominantne množice in dominantnega števila.
Starčevič, Jasmina
core
Roman Domination in Complementary Prism Graphs [PDF]
, 2012 A Roman domination function on a complementary prism graph GGc is a function f : V [ V c ! {0, 1, 2} such that every vertex with label 0 has a neighbor with label 2. The Roman domination number R(GGc) of a graph G = (V,E) is the minimum of Px2V [V c f(x)
Chaitra, V., Chaluvaraju, B.
core
On the strong Roman domination number of graphs [PDF]
, 2017 Based on the history that the Emperor Constantine decreed that any undefended place (with no legions) of the Roman Empire must be protected by a “stronger” neighbor place (having two legions), a graph theoretical model called Roman domination in graphs ...
Álvarez Ruiz, María del Pilar +4 more
core +1 more source