Results 1 to 10 of about 279,742 (250)

Double edge resolving set and exchange property for nanosheet structure [PDF]

Heliyon
The exploration of edge metric dimension and its applications has been an ongoing discussion, particularly in the context of nanosheet graphs formed from the octagonal grid. Edge metric dimension is a concept that involves uniquely identifying the entire
Ali N.A. Koam, Ali Ahmad, Sikander Ali, Muhammad Kamran Jamil, Muhammad Azeem   +4 more
doaj   +5 more sources

Computing Edge Metric Dimension of One-Pentagonal Carbon Nanocone

Frontiers in Physics, 2021
Minimum resolving sets (edge or vertex) have become an integral part of molecular topology and combinatorial chemistry. Resolving sets for a specific network provide crucial information required for the identification of each item contained in the ...
Sunny Kumar Sharma, Hassan Raza, Vijay Kumar Bhat   +2 more
doaj   +4 more sources

Edge Version of Metric Dimension and Doubly Resolving Sets of the Necklace Graph

Mathematics, 2018
Consider an undirected and connected graph G = ( V G , E G ) , where V G and E G represent the set of vertices and the set of edges respectively.
Jia-Bao Liu, Zohaib Zahid, Ruby Nasir, Waqas Nazeer   +3 more
doaj   +4 more sources

Patched Network and Its Vertex-Edge Metric-Based Dimension

IEEE Access, 2023
The p-type networks are designed with the help of CVNET at topo group Cluj and also given support by nano studio. Such networks develop new p-type surfaces and also represent the decorations of the surfaces.
Sidra Bukhari, Muhammad Kamran Jamil, Muhammad Azeem, Senesie Swaray   +3 more
doaj   +2 more sources

Computation of Edge Resolvability of Benzenoid Tripod Structure

Journal of Mathematics, 2021
In chemistry, graphs are commonly used to show the structure of chemical compounds, with nodes and edges representing the atom and bond types, respectively.
Ali Ahmad, Sadia Husain, Muhammad Azeem, Kashif Elahi, M. K. Siddiqui   +4 more
doaj   +2 more sources

Total resolving number of edge cycle graphs

AKCE International Journal of Graphs and Combinatorics, 2020
Let G=(V,E) be a simple connected graph. An ordered subset W of V is said to be a resolving set of G if every vertex is uniquely determined by its vector of distances to the vertices in W.
J. Joseph, N. Shunmugapriya
semanticscholar   +3 more sources

Some Resolving Parameters in a Class of Cayley Graphs [PDF]

Journal of Mathematics, 2022
Resolving parameters are a fundamental area of combinatorics with applications not only to many branches of combinatorics but also to other sciences.
Jia-Bao Liu, Ali Zafari
doaj   +2 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

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   +2 more sources

Edge-Version of Fault-Tolerant Resolvability in Networks

IEEE Access
Fault tolerance refers to a system’s capacity to continue functioning as intended, even when one of its components fails. Such a system is known as a fault-tolerant, self-stable system.
Muhammad Faheem, Muhammad Ahmad, Zohaib Zahid, Muhammad Javaid, Mamo Abebe Ashebo   +4 more
doaj   +2 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   +2 more sources