Author:
Hussain Zafar,Munir Mobeen,Ahmad Ashfaq,Chaudhary Maqbool,Alam Khan Junaid,Ahmed Imtiaz
Abstract
AbstractResolving set and metric basis has become an integral part in combinatorial chemistry and molecular topology. It has a lot of applications in computer, chemistry, pharmacy and mathematical disciplines. A subset S of the vertex set V of a connected graph G resolves G if all vertices of G have different representations with respect to S. A metric basis for G is a resolving set having minimum cardinal number and this cardinal number is called the metric dimension of G. In present work, we find a metric basis and also metric dimension of 1-pentagonal carbon nanocones. We conclude that only three vertices are minimal requirement for the unique identification of all vertices in this network.
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Khuller, S., Raghavachari, B. & Rosenfeld, A. Landmarks in graphs. Discret. Appl. Math. 70, 217–229 (1996).
2. Chartrand, G., Poisson, C. & Zhang, P. Resolvability and the upper dimension of graphs. Comput. Math. Appl. 39, 19–28 (2000).
3. Harary, F. & Melter, R. A. On the metric dimension of a graph. Ars Comb. 2, 191–195 (1976).
4. Slater, P. J. Leaves of trees. Congr. Numer. 14, 549–559 (1975).
5. Sebo, A. & Tannier, E. On metric generators of graphs. Math. Oper. Res. 29, 383–393 (2004).
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献