Results 301 to 310 of about 776,655 (324)
Letters of recognition: the spatial inscription of literature in the Romanian street nomenclature. [PDF]
Humanit Soc Sci CommunRusu MS, Baghiu S.
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 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
Algorithmic Aspects of Outer-Independent Double Roman Domination in Graphs
International Journal of Foundations of Computer ScienceLet [Formula: see text] be graph. For any function [Formula: see text], let [Formula: see text], [Formula: see text]. The function [Formula: see text] is called an outer-independent double Roman dominating function (OIDRDF) if the following conditions ...
Amit Sharma +3 more
semanticscholar +1 more source
2020
This chapter is concerned with the concept Roman domination in graphs, which was introduced in 2004 by Cockayne, Dreyer, S.M. Hedetniemi, and S.T. Hedetniemi based on the strategies for defending the Roman Empire presented by Stewart (Sci Am 281:136–139, 1999) and ReVelle and Rosing (ReVelle CS, Rosing KE, Am Math Mon 107:585–594, 2000).
Nader Jafari Rad +3 more
openaire +2 more sources
This chapter is concerned with the concept Roman domination in graphs, which was introduced in 2004 by Cockayne, Dreyer, S.M. Hedetniemi, and S.T. Hedetniemi based on the strategies for defending the Roman Empire presented by Stewart (Sci Am 281:136–139, 1999) and ReVelle and Rosing (ReVelle CS, Rosing KE, Am Math Mon 107:585–594, 2000).
Nader Jafari Rad +3 more
openaire +2 more sources
Comparative Analysis Of Roman And Inverse Roman Domination Numbers Across Graph Families.
Educational Administration: Theory and PracticeThis research paper delves into the intriguing realm of Roman domination and its inverse counterpart within various graph structures. Initially defining Roman domination as a graph theory concept where vertices are covered by distinct dominating sets ...
J. J. Raji, Dr. S Meenakshi
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. N. M. M. Mai
semanticscholar +1 more source
(Independent) Roman Domination Parameterized by Distance to Cluster
International Conference on Combinatorial Optimization and ApplicationsGiven a graph $G=(V,E)$, a function $f:V\to \{0,1,2\}$ is said to be a \emph{Roman Dominating function} (RDF) if for every $v\in V$ with $f(v)=0$, there exists a vertex $u\in N(v)$ such that $f(u)=2$.
Pradeesha Ashok +4 more
semanticscholar +1 more source