The Simultaneous Strong Resolving Graph and the Simultaneous Strong Metric Dimension of Graph Families [PDF]
Mathematics, 2020 We consider in this work a new approach to study the simultaneous strong metric dimension of graphs families, while introducing the simultaneous version of the strong resolving graph.
Ismael González Yero
doaj +8 more sources
The Strong Resolving Graph and the Strong Metric Dimension of Cactus Graphs [PDF]
Mathematics, 2020 A vertex w of a connected graph G strongly resolves two distinct vertices u,v∈V(G), if there is a shortest u,w path containing v, or a shortest v,w path containing u. A set S of vertices of G is a strong resolving set for G if every two distinct vertices
Dorota Kuziak
doaj +5 more sources
Further new results on strong resolving partitions for graphs [PDF]
Open Mathematics, 2020 A set W of vertices of a connected graph G strongly resolves two different vertices x, y ∉ W if either d G(x, W) = d G(x, y) + d G(y, W) or d G(y, W) = d G(y, x) + d
Kuziak Dorota, Yero Ismael G.
doaj +6 more sources
Metric Dimension, Minimal Doubly Resolving Sets, and the Strong Metric Dimension for Jellyfish Graph and Cocktail Party Graph [PDF]
Complexity, 2020 Let Γ be a simple connected undirected graph with vertex set VΓ and edge set EΓ. The metric dimension of a graph Γ is the least number of vertices in a set with the property that the list of distances from any vertex to those in the set uniquely ...
Jia-Bao Liu, Ali Zafari, Hassan Zarei
doaj +3 more sources
Computing Minimal Doubly Resolving Sets and the Strong Metric Dimension of the Layer Sun Graph and the Line Graph of the Layer Sun Graph [PDF]
Complexity, 2020 Let G be a finite, connected graph of order of, at least, 2 with vertex set VG and edge set EG. A set S of vertices of the graph G is a doubly resolving set for G if every two distinct vertices of G are doubly resolved by some two vertices of S.
Jia-Bao Liu, Ali Zafari
doaj +4 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
A Study on Fuzzy Resolving Domination Sets and Their Application in Network Theory
Mathematics, 2023 Consider a simple connected fuzzy graph (FG) G and consider an ordered fuzzy subset H = {(u1, σ(u1)), (u2, σ(u2)), …(uk, σ(uk))}, |H| ≥ 2 of a fuzzy graph; then, the representation of σ − H is an ordered k-tuple with regard to H of G. If any two elements
Manimozhi Vasuki +3 more
doaj +1 more source
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
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
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