Results 11 to 20 of about 14,788 (226)
Strong Resolving Graphs of U-Clean Graphs of Finite Commutative Rings [PDF]
Journal of MathematicsLet R be a finite commutative ring with identity 1. The U-clean graph U-ClR of a ring R is a simple undirected graph with vertices are of the form e,u, where e is a nonzero idempotent and u is a unit of R, and two distinct vertices e,u, f,v of U-ClR are ...
Ziyi Wu, Xiaobin Yin
doaj +3 more sources
Strong resolving graph of the intersection graph in commutative rings [PDF]
, 2023 The intersection graph of ideals associated with a commutative unitary ring $R$ is the graph $G(R)$ whose vertices all non-trivial ideals of $R$ and there exists an edge between distinct vertices if and only if the intersection of them is non-zero. In this paper, the structure of the resolving graph of $G(R)$ is characterized and as an application, we ...
Dodongeh, E. +2 more
openaire +3 more sources
Fairness-Aware Predictive Graph Learning in Social Networks [PDF]
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 +3 more sources
On the strong metric dimension of the strong products of graphs [PDF]
Open Mathematics, 2015 Let G be a connected graph. A vertex w ∈ V.G/ strongly resolves two vertices u,v ∈ V.G/ if there exists some shortest u-w path containing v or some shortest v-w path containing u.
Kuziak Dorota +2 more
doaj +2 more sources
A Study on Regular Domination in Vague Graphs with Application [PDF]
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 +2 more sources
Strong Resolving Graphs of Clean Graphs of Commutative Rings [PDF]
Let $R$ be a ring with unity. The clean graph $\text{Cl}(R)$ of a ring $R$ is the simple undirected graph whose vertices are of the form $(e,u)$, where $e$ is an idempotent element and $u$ is a unit of the ring $R$ and two vertices $(e,u)$, $(f,v)$ of $\text{Cl}(R)$ are adjacent if and only if $ef = fe =0$ or $uv = vu=1$.
Mathil, Praveen, Kumar, Jitender
openaire +3 more sources
On Strong Metric Dimension of the Methane Molecular Graph Using Resolving Sets
Journal of Physics: Conference SeriesAbstract In graph theory, a graph’s strong metric dimension is a crucial quantity that has applications in molecular chemistry, network architecture, and navigation systems. This study focuses on evaluating Molecular graph’s methane CH 4 strong metric dimension which is a fundamental molecule in organic chemistry.
P. Tharaniya +4 more
exaly +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
On Movable Strong Resolving Domination in Graphs
European Journal of Pure and Applied Mathematics, 2022 Let G be a connected graph. A strong resolving dominating set S is a 1-movable strong resolving dominating set of G if for every v ∈ S, either S \ {v} is a strong resolving dominating set or there exists a vertex u ∈ (V (G) \ S) ∩ NG(v) such that (S \ {v}) ∪ {u} is a strong resolving dominating set of G.
Helyn Cosinas Sumaoy, Helen Rara
openaire +1 more source