Convex polytopes of constant local multiset dimension with an application
*K. PragathiCorresponding authorpragathigowda11@gmail.comDepartment of MathematicsNitte Meenakshi Institute of TechnologyAffiliated to Visvesvaraya Technological UniversityBengaluru, Karnataka, 560064, India0009-0009-9675-5806View full profile → , S. B. Chandrakalachandrkalasb14@gmail.comDepartment of MathematicsNitte Meenakshi Institute of TechnologyNitte (Deemed to be University)Bengaluru, Karnataka, 560064, India0000-0002-4868-4187View full profile → , B. Sooryanarayanadr_bnsrao@yahoo.co.inDepartment of MathematicsDr. Ambedkar Institute of TechnologyBengaluru, Karnataka, 560056, India0000-0002-2835-2855View full profile → , J. Ravikumarravikumj@srmist.edu.inDepartment of MathematicsSRM Institute of Science & Technology, Vadapalani CampusVadapalani, Chennai, Tamil Nadu, 600026, India0000-0002-1667-8874View full profile →
* Corresponding author · click or hover a name for details
- Received:
- 01 Oct 2025
- Published Online:
- 31 Jul 2026
- Article type:
- Research Article
- Language:
- EN
- Article no.:
- JIOS-2368
- Pages:
- 2821–2836
Abstract
Determining the minimum monitoring points in a road network which remains constant, even as the network expands plays a crucial role in efficient traffic monitoring, congestion detection and adaptive signal control. As traffic is the major issue in many cities, the minimum monitoring points can be located using a variation of metric dimension obtained by incorporating distance based multiset to distinguish adjacent vertices more effectively, called local multiset dimension(lmd). A convex polytope is a bounded geometric structure defined by a collection of convex points in n-dimensional Euclidean space Rn, which can be used to design and analyze networks. The lmd of N-gonal circular ladder is discussed and the result is extended to answer a road traffic problem.
Keywords
Subject Classifications
References
[1] M. Singh and V. K. Bhat, “ On metric dimension of hendecagonal circular ladder Hn,” Ann. Univ. Craiova Math. Comput. Sci. Ser., vol. 50, no. 2, pp. 394–403 (2023), doi: 10.1080/23799927.2024.2364650.
[2] R. Alfarisi, Y. Lin, J. Ryan, D. Dafik, and I. H. Agustin, “A note on multiset dimension and local multiset dimension of graphs,” Stat., Optim. Inf. Comput., vol. 8, no. 4, pp. 890–901 (2020), doi: 10.19139/soic-2310-5070-727.
[3] P. J. Slater, “Leaves of trees,” Congr. Numer., vol. 14, no. 549–559 (1975).
[4] F. Harary and R. A. Melter, “On the metric dimension of a graph,” Ars Combin., vol. 2, no. 2, pp. 191–195 (1976).
[5] Y. Listiana, L. Susilowati, S. Slamin, and K. Dliou, “The central local metric dimension of graphs with a single central vertex,” J. Discrete Math. Sci. Cryptogr., vol. 28, no. 6, pp. 2297–2308 (Sep. 2025), doi: 10.47974/JDMSC-2228.
[6] S. K. Sharma, Y. Al-Qudah, and V. K. Bhat, “On mixed metric dimension of flower and prism type graphs,” J. Discrete Math. Sci. Cryptogr. pp. 1–18 (Mar. 2026), doi: 10.47974/JDMSC-2602.
[7] R. Simanjuntak, P. Siagian, and T. Vetrík, “The multiset dimension of graphs,” arXiv preprint arXiv:1711.00225 (2017), doi: 10.48550/arXiv.1711.00225.
[8] R. Alfarisi, D. Dafik, A. I. Kristiana, and I. H. Agustin, “The local multiset dimension of graphs,” Int. J. Eng. Technol., vol. 8, no. 3, pp. 120–124 (2019), doi: 10.14419/ijet.v8i3.11643.
[9] R. Adawiyah, D. Dafik, R. M. Prihandini, E. R. Albirri, I. H. Agustin, and R. Alfarisi, “The local multiset dimension of unicyclic graph,” in IOP Conf. Ser.: Earth Environ. Sci., vol. 243, no. 1, Art. no. 012075 (2019), doi: 10.1088/1755-1315/243/1/012075.
[10] R. Adawiyah, D. Dafik, I. H. Agustin, R. M. Prihandini, R. Alfarisi, and E. R. Albirri, “On the local multiset dimension of graph with homogeneous pendant edges,” J. Phys.: Conf. Ser., vol. 1538, no. 1, Art. no. 012023 (2020), doi: 10.1088/1742-6596/1538/1/012023.
[11] N. R. Shankar, S. B. Chandrakala, and B. Sooryanarayana, “On the local multiset dimension of a graph,” Discrete Math. Algorithms Appl., vol. 17, no. 5, Art. no. 2550018 (2025), doi: 10.1142/S1793830925500181.
[12] F. Harary, Graph Theory. Boca Raton, FL, USA: CRC Press (2018), doi: 10.1201/9780429493768.
[13] R. Alfarisi, L. Susilowati, D. Dafik, and S. Prabhu, “Local multiset dimension of amalgamation graphs,” F1000Research, vol. 12, Art. no. 95 (2024), doi: 10.12688/f1000research.128866.2.
[14] Y. Zhang and S. Gao, “On the edge metric dimension of convex polytopes and its related graphs,” J. Comb. Optim., vol. 39, no. 2, pp. 334–350 (2020), doi: 10.1007/s10878-019-00472-4.
