Bounds for partition dimension of M-wheels-Reference-Cited by-同舟云学术

Bounds for partition dimension of M-wheels

Published:2019-01-01 Issue:1 Volume:17 Page:340-344
ISSN:2391-5471
Container-title:Open Physics
language:en
Short-container-title:

Author:

Hussain Zafar¹,Kang Shin Min²³,Rafique Muqdas⁴,Munir Mobeen⁵,Ali Usman⁶,Zahid Aqsa⁷,Saleem Muhammad Shoaib⁸

Affiliation:

1. Department of Mathematics and Statistics, The University of Lahore , Lahore 54500 , Pakistan

2. Department of Mathematics and Research Institute of Natural Science, Gyeongsang National University , Jinju 52828 , Korea

3. Center for General Education, China Medical University , Taichung 40402 , Taiwan

4. Department of Mathematics , BZU , Pakistan

5. Department of mathematics, Division of Science and Technology, University of Education , Lahore - Pakistan

6. Centre for advanced studies in pure and applied mathematics, Bahauddin Zakariya University Multan , Multan , Pakistan

7. Minhaj University , Lahore - Pakistan

8. Department of Mathematics, University of Okara , Okara 56300 , Pakistan

Abstract

Abstract Resolving partition and partition dimension have multipurpose applications in computer, networking, optimization, mastermind games and modelling of chemical substances. The problem of finding exact values of partition dimension is hard so one can find bound for the partition dimension of a general family of graph. In the present article, we give the sharp upper bounds and lower bounds for the partition dimension of m-wheel, Wn , m for all n ≥ 4 and m ≥ 1. Presented data generalise some already available results.

Publisher

Walter de Gruyter GmbH

Subject

General Physics and Astronomy

Link

https://www.degruyter.com/document/doi/10.1515/phys-2019-0037/pdf

Reference40 articles.

1. Blumenthal L.M., Theory and Applications of Distance Geometry Clarendon Press, Oxford (1953).

2. Chartrand G., Eroh L., Johnson M. A., Oellermann, O. R., Resolvibility in graphs and the metric dimension of a graph Disc. Appl. Math., 105(2000), 99-133.

3. Caceres J., Hernando C., Mora M., Pelayo I.M., Puertas M.L., Seara C., Wood D.R., On the metric dimension of cartesian product of graphs SIAM J.Disc. Math., 2(21), (2007), 423-441.

4. Caceres J., Hernando C., Mora M., Pelayo I.M., Puertas M.L., Seara C., Wood D.R., On the metric dimension of some families of graphs Electronic Notes in Disc. Math., 22(2005), 129-133.

5. Khuller S., Raghavachari B., Rosenfeld A., Landmarks in graphs Discrete Appl. Math., 70 (1996), pp. 217-229.

Cited by 15 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Structural Analysis of Octagonal Nanotubes via Double Edge-Resolving Partitions;Processes;2024-09-06

2. Double edge resolving set and exchange property for nanosheet structure;Heliyon;2024-03

3. On the Constant Partition Dimension of Some Generalized Families of Toeplitz Graph;Journal of Mathematics;2024-01

4. On Partition Dimension of Generalized Convex Polytopes;Journal of Mathematics;2023-09-14

5. Note on the finite vertex-based partitioning of supramolecular chain in Dialkyltin;Molecular Physics;2023-09-07