Results 281 to 290 of about 670,635 (308)
Meta-Heuristic Algorithms for Quasi Total Double Roman Domination Problem
Charan Karnati +2 more
openalex +1 more source
On- and Offline Psychological Violence in Young Dyads: Frequency, Directionality, and Justifications. [PDF]
Int J Psychol Res (Medellin)Lorente-Anguís A, Lopez-Zafra E.
europepmc +1 more source
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Quaestiones Mathematicae, 2015
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +3 more sources
A set S of vertices is a total dominating set of a graph G if every vertex of G is adjacent to some vertex in S. The minimum cardinality of a total dominating set is the total domination number γt(G). A Roman dominating function on a graph G is a function ƒ : V (G) → {0, 1, 2} satisfying the condition that every vertex u with ƒ(u) = 0 is adjacent to at
Chellali, Mustapha +2 more
openaire +3 more sources
Graphs and Combinatorics, 2015
For a graph $$G=(V,E)$$G=(V,E), a Roman dominating function $$f:V\rightarrow \{0,1,2\}$$f:V?{0,1,2} has the property that every vertex $$v\in V$$v?V with $$f(v)=0$$f(v)=0 has a neighbor $$u$$u with $$f(u)=2$$f(u)=2. The weight of a Roman dominating function $$f$$f is the sum $$f(V)=\sum \nolimits _{v\in V}f(v)$$f(V)=?v?Vf(v), and the minimum weight of ...
Chellali, Mustapha +4 more
openaire +3 more sources
For a graph $$G=(V,E)$$G=(V,E), a Roman dominating function $$f:V\rightarrow \{0,1,2\}$$f:V?{0,1,2} has the property that every vertex $$v\in V$$v?V with $$f(v)=0$$f(v)=0 has a neighbor $$u$$u with $$f(u)=2$$f(u)=2. The weight of a Roman dominating function $$f$$f is the sum $$f(V)=\sum \nolimits _{v\in V}f(v)$$f(V)=?v?Vf(v), and the minimum weight of ...
Chellali, Mustapha +4 more
openaire +3 more sources
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. N. M. M. Mai
semanticscholar +1 more source
Exploring Algorithmic Solutions for the Independent Roman Domination Problem in Graphs
Discrete Applied MathematicsGiven a graph $G=(V,E)$, a function $f:V\to \{0,1,2\}$ is said to be a \emph{Roman Dominating function} if for every $v\in V$ with $f(v)=0$, there exists a vertex $u\in N(v)$ such that $f(u)=2$.
Kaustav Paul, Ankit Sharma, Arti Pandey
semanticscholar +1 more source