Results 1 to 10 of about 1,385,922 (245)

The Metric Dimension and Local Metric Dimension of Relative Prime Graph [PDF]

open access: yesCauchy: Jurnal Matematika Murni dan Aplikasi, 2020
This study aims to determine the value of metric dimensions and local metric dimensions of relative prime graphs formed from modulo  integer rings, namely . As a vertex set is  and  if  and  are relatively prime.
Inna Kuswandari   +2 more
doaj   +2 more sources

Metric Dimension Threshold of Graphs

open access: yesJournal of Mathematics, 2022
Let G be a connected graph. A subset S of vertices of G is said to be a resolving set of G, if for any two vertices u and v of G there is at least a member w of S such that du,w≠dv,w.
Meysam Korivand   +2 more
doaj   +2 more sources

The dominant metric dimension of graphs

open access: yesHeliyon, 2020
The G be a connected graph with vertex set V(G) and edge set E(G). A subset S⊆V(G) is called a dominating set of G if for every vertex x in V(G)∖S, there exists at least one vertex u in S such that x is adjacent to u.
Liliek Susilowati   +4 more
doaj   +3 more sources

Graphs of Neighborhood Metric Dimension Two

open access: yesJournal of Mathematical and Fundamental Sciences, 2021
A subset  of vertices of a simple connected graph is a neighborhood set (n-set) of  G if G is the union of subgraphs of G induced by the closed neighbors of elements in S. Further, a set S is a resolving set of G if for each pair of distinct vertices x,y
Badekara Sooryanarayana   +1 more
doaj   +1 more source

On Mixed Metric Dimension of Rotationally Symmetric Graphs

open access: yesIEEE Access, 2020
A vertex u ∈ V(G) resolves (distinguish or recognize) two elements (vertices or edges) v, w ∈ E(G)UV(G) if dG(u, v) ≠ dG(u, w) . A subset Lm of vertices in a connected graph G is called a mixed metric generator for G if every two ...
Hassan Raza, Jia-Bao Liu, Shaojian Qu
doaj   +1 more source

Remarks on the Vertex and the Edge Metric Dimension of 2-Connected Graphs

open access: yesMathematics, 2022
The vertex (respectively edge) metric dimension of a graph G is the size of a smallest vertex set in G, which distinguishes all pairs of vertices (respectively edges) in G, and it is denoted by dim(G) (respectively edim(G)). The upper bounds dim(G)≤2c(G)−
Martin Knor   +2 more
doaj   +1 more source

On Mixed Metric Dimension of Some Path Related Graphs

open access: yesIEEE Access, 2020
A vertex $k\in V_{G}$ determined two elements (vertices or edges) $\ell,m \in V_{G}\cup E_{G}$ , if $d_{G}(k,\ell)\neq d_{G}(k,m)$ . A set $R_ {\text {m}}$ of vertices in a graph $G$ is a mixed metric generator for $G$ , if two distinct elements
Hassan Raza, Ying Ji, Shaojian Qu
doaj   +1 more source

Metric and Fault-Tolerant Metric Dimension of Hollow Coronoid

open access: yesIEEE Access, 2021
Coronoid systems actually arrangements of hexagons into six sides of benzenoids. By nature, it is an organic chemical structure. Hollow coronoids are primitive and catacondensed coronoids. It is also known as polycyclic conjugated hydrocarbons.
Ali N. A. Koam   +3 more
doaj   +1 more source

Computing the Mixed Metric Dimension of a Generalized Petersen Graph P(n, 2)

open access: yesFrontiers in Physics, 2020
Let Γ = (V, E) be a connected graph. A vertex i ∈ V recognizes two elements (vertices or edges) j, k ∈ E ∩ V, if dΓ(i, j) ≠ dΓ(i, k). A set S of vertices in a connected graph Γ is a mixed metric generator for Γ if every two distinct elements (vertices or
Hassan Raza, Ying Ji
doaj   +1 more source

Study of Convexo-Symmetric Networks via Fractional Dimensions

open access: yesIEEE Access, 2022
For having an in-depth study and analysis of various network’s structural properties such as interconnection, extensibility, availability, centralization, vulnerability and reliability, we require distance based graph theoretic parameters ...
Muhammad Kamran Aslam   +3 more
doaj   +1 more source

Home - About - Disclaimer - Privacy