Abstract
Abstract
For an undirected connected graph G = G(V, E) with vertex set V(G) and edge set E(G), a subset R of V is said to be a resolving in G, if each pair of vertices (say a and b; a ≠ b) in G satisfy the relation d(a, k) ≠ d(b, k), for at least one member k in R. The minimum set R with this resolving property is said to be a metric basis for G, and the cardinality of such set R, is referred to as the metric dimension of G, denoted by dim
v
(G). In this manuscript, we consider a complex molecular graph of one-heptagonal carbon nanocone (represented by HCN
s
) and investigate its metric basis as well as metric dimension. We prove that just three specifically chosen vertices are enough to resolve the molecular graph of HCN
s
. Moreover, several theoretical as well as applicative properties including comparison have also been incorporated.
Reference45 articles.
1. Graph theory in chemical kinetics practice problems;Szukiewicz;Top. Catal.,2024
2. Analysing spectral parameters of decane-A graph theoretical perspective;Andrew;Results Control Optim.,2024
3. On distance-based topological invariants of Isaac graphs;Bhat;Palest. j. math.,2023
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献