Computing Edge Version of Resolvability and Double Resolvability of a Graph
The field of graph theory is extensively used to investigate structure models in biology, computer programming, chemistry, and combinatorial optimization. In order to work with the chemical structure, chemists require a mathematical form of the compound. The chemical structure can be depicted using...
Saved in:
Main Authors: | Muhammad Ahmad, Zohaib Zahid, Tabasam Rashid, Juan Luis Garcia Guirao |
---|---|
Format: | Article |
Language: | English |
Published: |
Wiley
2022-01-01
|
Series: | Journal of Chemistry |
Online Access: | http://dx.doi.org/10.1155/2022/2448032 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Retracted: Computing Edge Version of Resolvability and Double Resolvability of a Graph
by: Journal of Chemistry
Published: (2023-01-01) -
On the Constant Edge Resolvability of Some Unicyclic and Multicyclic Graphs
by: Dalal Alrowaili, et al.
Published: (2022-01-01) -
On resolving edge colorings in graphs
by: Varaporn Saenpholphat, et al.
Published: (2003-01-01) -
Minimal Doubly Resolving Sets of Some Classes of Convex Polytopes
by: Muhammad Ahmad, et al.
Published: (2022-01-01) -
Maximal resolving sets in a graph
by: V. Swaminathan, et al.
Published: (2024-12-01)