<?xml version="1.0" encoding="UTF-8"?>
<article article-type="Research Article">
  <front>
    <journal-meta>
      <journal-id journal-id-type="publisher">journal-of-information-and-optimization-sciences</journal-id>
      <journal-title-group>
        <journal-title>Journal of Information and Optimization Sciences</journal-title>
      </journal-title-group>
      <issn publication-format="electronic">2169-0103</issn>
      <issn publication-format="print">0252-2667</issn>
      <publisher>
        <publisher-name>Taru Publications</publisher-name>
      </publisher>
    </journal-meta>
    <article-meta>
      <article-id pub-id-type="doi">10.47974/JIOS-2368</article-id>
      <title-group>
        <article-title>Convex polytopes of constant local multiset dimension with an application</article-title>
      </title-group>
      <contrib-group>
        <contrib contrib-type="author" corresp="yes">
          <name>
            <surname>Pragathi</surname>
            <given-names>K.</given-names>
          </name>
          <aff>Department of Mathematics, Nitte Meenakshi Institute of Technology, Affiliated to Visvesvaraya Technological University, Bengaluru, Karnataka, 560064, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Chandrakala</surname>
            <given-names>S.  B.</given-names>
          </name>
          <aff>Department of Mathematics, Nitte Meenakshi Institute of Technology, Nitte (Deemed to be University), Bengaluru, Karnataka, 560064, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Sooryanarayana</surname>
            <given-names>B.</given-names>
          </name>
          <aff>Department of Mathematics, Dr. Ambedkar Institute of Technology, Bengaluru, Karnataka, 560056, India</aff>
        </contrib>
        <contrib contrib-type="author">
          <name>
            <surname>Ravikumar</surname>
            <given-names>J.</given-names>
          </name>
          <aff>Department of Mathematics, SRM Institute of Science &amp; Technology, Vadapalani Campus, Vadapalani, Chennai, Tamil Nadu, 600026, India</aff>
        </contrib>
      </contrib-group>
      <volume>47</volume>
      <issue>7</issue>
      <fpage>2821</fpage>
      <lpage>2836</lpage>
      <pub-date date-type="pub">
        <day>31</day>
        <month>07</month>
        <year>2026</year>
      </pub-date>
      <abstract>
        <p>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.</p>
      </abstract>
      <kwd-group>
        <kwd>Convex polytope</kwd>
        <kwd>Local multiset dimension</kwd>
        <kwd>Metric dimension</kwd>
      </kwd-group>
      <custom-meta-group>
        <custom-meta>
          <meta-name>access</meta-name>
          <meta-value>open</meta-value>
        </custom-meta>
        <custom-meta>
          <meta-name>retracted</meta-name>
          <meta-value>no</meta-value>
        </custom-meta>
      </custom-meta-group>
    </article-meta>
  </front>
</article>
