Results 21 to 30 of about 14,788 (226)
On Restrained Strong Resolving Domination in Graphs
European Journal of Pure and Applied Mathematics, 2021 A set S ⊆ V (G) is a restrained strong resolving dominating set in G if S is a strongresolving dominating set in G and S = V (G) or ⟨V (G) \ S⟩ has no isolated vertex. The restrained strong resolving domination number of G, denoted by γrsR(G), is the smallest cardinality of a restrained strong resolving dominating set in G.
Helyn Cosinas Sumaoy, Helen M. Rara
openaire +2 more sources
Strong Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2023 A vertex w in a connected graph G strongly resolves two distinct vertices u and v in V (G) if v is in any shortest u-w path or if u is in any shortest v-w path. A set W of vertices in G is a strong resolving set G if every two vertices of G are strongly resolved by some vertex of W.
Jerson Mohamad, Helen Rara
openaire +1 more source
Restrained Strong Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2022 A set S ⊆ V (G) is a restrained strong resolving hop dominating set in G if for every v ∈ V (G)\S, there exists w ∈ S such that dG(v, w) = 2 and S = V (G) or V (G)\S has no isolated vertex. The smallest cardinality of such a set, denoted by γrsRh(G), is called the restrained strong resolving hop domination number of G.
Armalene Abragan, Helen Rara
openaire +1 more source
Strong Resolving Domination in the Lexicographic Product of Graphs
European Journal of Pure and Applied Mathematics, 2023 Let G be a connected graph. A subset S ⊆ V (G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u, v ∈ V (G), there exists a vertex w ∈ S such that u ∈ IG[v, w] or IG[u, w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination number of G.
Gerald Bacon Monsanto +2 more
openaire +1 more source
Distributed Answer Set Coloring: Stable Models Computation via Graph Coloring [PDF]
Electronic Proceedings in Theoretical Computer Science, 2019 Answer Set Programming (ASP) is a famous logic language for knowledge representation, which has been really successful in the last years, as witnessed by the great interest into the development of efficient solvers for ASP.
Marco De Bortoli
doaj +1 more source
On the resolving strong domination number of graphs: a new notion
Journal of Physics: Conference Series, 2021 Abstract The study of metric dimension of graph G has widely given some results and contribution of graph research of interest, including the domination set theory. The dominating set theory has been quickly growing and there are a lot of natural extension of this study, such as vertex domination, edge domination, total domination, power
null Dafik +4 more
openaire +1 more source
On 1-movable Strong Resolving Hop Domination in Graphs
European Journal of Pure and Applied Mathematics, 2023 A set S is a 1-movable strong resolving hop dominating set of G if for every v ∈ S, either S\{v} is a strong resolving hop dominating set or there exists a vertex u ∈ (V (G)\S)∩NG(v) such that (S \ {v}) ∩ {u} is a strong resolving hop dominating set of G.
Armalene Abragan, Helen M. Rara
openaire +1 more source
On the Metric Representation of the Vertices of a Graph [PDF]
, 2023 The version of record is available online at: http://dx.doi.org/10.1007/s40840-023-01582-3The metric representation of a vertex u in a connected graph G respect to an ordered vertex subset is the vector of distances . A vertex subset W is a resolving set
María Luz Puertas +4 more
core +1 more source
Presentations of context-free shifts [PDF]
, 2023 Submission note: A thesis submitted in total fulfilment of the requirements for the degree of Doctor of Philosophy to the School of Engineering and Mathematical Sciences, Faculty of Science, Technology and Engineering, La Trobe University, Bundoora.This ...
Nguyen, Thi Thuy Dung (14363634)
core +3 more sources
On Strong Resolving Domination in the Join and Corona of Graphs
European Journal of Pure and Applied Mathematics, 2020 Let G be a connected graph. A subset S \subseteq V(G) is a strong resolving dominating set of G if S is a dominating set and for every pair of vertices u,v \in V(G), there exists a vertex w \in S such that u \in I_G[v,w] or v \in I_G[u,w]. The smallest cardinality of a strong resolving dominating set of G is called the strong resolving domination ...
Gerald Bacon Monsanto +2 more
openaire +2 more sources