Results 11 to 20 of about 269,190 (213)
On the resolving strong domination number of some wheel related graphs
Journal of Physics: Conference Series, 2022 This study aims to analyse the resolving strong dominating set. This concept combinations of two notions, they are metric dimension and strong domination set.
R. Humaizah +4 more
semanticscholar +2 more sources
On the resolving strong domination number of graphs: a new notion
Journal of Physics: Conference Series, 2021 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.
Dafik +4 more
semanticscholar +2 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].
Gerald B. Monsanto +2 more
semanticscholar +3 more sources
On Strong Metric Dimension of the Methane Molecular Graph Using Resolving Sets
Journal of Physics: Conference SeriesIn graph theory, a graph’s strong metric dimension is a crucial quantity that has applications in molecular chemistry, network architecture, and navigation systems.
P. Tharaniya +4 more
semanticscholar +2 more sources
New Algorithms for Mixed Dominating Set [PDF]
Discrete Mathematics & Theoretical Computer Science, 2021 A mixed dominating set is a collection of vertices and edges that dominates all vertices and edges of a graph. We study the complexity of exact and parameterized algorithms for \textsc{Mixed Dominating Set}, resolving some open questions.
Louis Dublois +2 more
doaj +1 more source
Resolvability and Strong Resolvability in the Direct Product of Graphs [PDF]
Results in Mathematics, 2016 Given a connected graph $G$, a vertex $w\in V(G)$ distinguishes two different vertices $u,v$ of $G$ if the distances between $w$ and $u$ and between $w$ and $v$ are different. Moreover, $w$ strongly resolves the pair $u,v$ if there exists some shortest $u-w$ path containing $v$ or some shortest $v-w$ path containing $u$.
Dorota Kuziak +2 more
openaire +3 more sources
Fairness-Aware Predictive Graph Learning in Social Networks
Mathematics, 2022 Predictive graph learning approaches have been bringing significant advantages in many real-life applications, such as social networks, recommender systems, and other social-related downstream tasks. For those applications, learning models should be able
Lei Wang +4 more
doaj +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
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
A Study on Regular Domination in Vague Graphs with Application
Advances in Mathematical Physics, 2023 Vague graphs (VGs), which are a family of fuzzy graphs (FGs), are a well-organized and useful tool for capturing and resolving a range of real-world scenarios involving ambiguous data. In graph theory, a dominating set (DS) for a graph G∗=X,E is a subset
Xiaolong Shi +3 more
doaj +1 more source