<?xml version="1.0" encoding="ISO-8859-1"?><article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance">
<front>
<journal-meta>
<journal-id>1405-5546</journal-id>
<journal-title><![CDATA[Computación y Sistemas]]></journal-title>
<abbrev-journal-title><![CDATA[Comp. y Sist.]]></abbrev-journal-title>
<issn>1405-5546</issn>
<publisher>
<publisher-name><![CDATA[Instituto Politécnico Nacional, Centro de Investigación en Computación]]></publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id>S1405-55462024000402171</article-id>
<article-id pub-id-type="doi">10.13053/cys-28-4-5300</article-id>
<title-group>
<article-title xml:lang="en"><![CDATA[Branching and Pruning Algorithm for Computing the Merrifield-Simmons Index on Polygonal Grids]]></article-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname><![CDATA[González-Vázquez]]></surname>
<given-names><![CDATA[Herlinda]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[López-Ramírez]]></surname>
<given-names><![CDATA[Cristina]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Bello-López]]></surname>
<given-names><![CDATA[Pedro]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
<contrib contrib-type="author">
<name>
<surname><![CDATA[Ita-Luna]]></surname>
<given-names><![CDATA[Guillermo de]]></given-names>
</name>
<xref ref-type="aff" rid="Aff"/>
</contrib>
</contrib-group>
<aff id="Af1">
<institution><![CDATA[,Universidad Juárez Autónoma de Tabasco División Académica de Ciencias y Tecnologías de la Información ]]></institution>
<addr-line><![CDATA[Villahermosa ]]></addr-line>
<country>Mexico</country>
</aff>
<aff id="Af2">
<institution><![CDATA[,Benemérita Universidad Autónoma de Puebla Facultad de Ciencias de la Computación ]]></institution>
<addr-line><![CDATA[Puebla ]]></addr-line>
<country>Mexico</country>
</aff>
<pub-date pub-type="pub">
<day>00</day>
<month>12</month>
<year>2024</year>
</pub-date>
<pub-date pub-type="epub">
<day>00</day>
<month>12</month>
<year>2024</year>
</pub-date>
<volume>28</volume>
<numero>4</numero>
<fpage>2171</fpage>
<lpage>2182</lpage>
<copyright-statement/>
<copyright-year/>
<self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_arttext&amp;pid=S1405-55462024000402171&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_abstract&amp;pid=S1405-55462024000402171&amp;lng=en&amp;nrm=iso"></self-uri><self-uri xlink:href="http://www.scielo.org.mx/scielo.php?script=sci_pdf&amp;pid=S1405-55462024000402171&amp;lng=en&amp;nrm=iso"></self-uri><abstract abstract-type="short" xml:lang="en"><p><![CDATA[Abstract: In this paper, we present the molecular structure of benzene as a regular hexagonal ring and an isomorphic hexagonal lattice, a molecular structure introduced by Merrifield-Simmons (  M S) in 1989. The   M S index, a topological index used in mathematical chemistry, is the number of independent sets of a graph  G. This index plays a crucial role in our understanding of complex molecular structures. The strategy to compute the   M S index involves the construction of a Hamiltonian trajectory in the input graph. These structures are discussed in fields such as theoretical and computational chemistry. Therefore, we propose a novel branch and bound method for counting independent sets on polygonal benzenoid meshes, highlighting its importance in the study of the analysis of complex molecular structures and its applicability in interdisciplinary scientific fields.]]></p></abstract>
<kwd-group>
<kwd lng="en"><![CDATA[Benzenoid]]></kwd>
<kwd lng="en"><![CDATA[independent sets]]></kwd>
<kwd lng="en"><![CDATA[Hamiltonian path]]></kwd>
</kwd-group>
</article-meta>
</front><back>
<ref-list>
<ref id="B1">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Bracho]]></surname>
<given-names><![CDATA[R. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Sánchez]]></surname>
<given-names><![CDATA[M. P. O.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Un algoritmo paralelo para el problema del conjunto independiente]]></article-title>
<source><![CDATA[Revista de Matemática: Teoría y Aplicaciones]]></source>
<year>2000</year>
<volume>7</volume>
<numero>1&#8211;2</numero>
<issue>1&#8211;2</issue>
<page-range>125-34</page-range></nlm-citation>
</ref>
<ref id="B2">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[de-Ita]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Rodríguez]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
<name>
<surname><![CDATA[Bello]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Contreras]]></surname>
<given-names><![CDATA[M.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Basic pattern graphs for the efficient computation of its number of independent sets]]></article-title>
<source><![CDATA[Pattern Recognition]]></source>
<year>2020</year>
<volume>12088</volume>
<page-range>57-66</page-range></nlm-citation>
</ref>
<ref id="B3">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[de-Ita-Luna]]></surname>
<given-names><![CDATA[G.]]></given-names>
</name>
<name>
<surname><![CDATA[Vidal]]></surname>
<given-names><![CDATA[M. T.]]></given-names>
</name>
<name>
<surname><![CDATA[Loranca]]></surname>
<given-names><![CDATA[B. B.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[A novel method for counting independent sets in a grid graph]]></article-title>
<source><![CDATA[International Journal of Combinatorial Optimization Problems and Informatics]]></source>
<year>2023</year>
<volume>14</volume>
<numero>1</numero>
<issue>1</issue>
</nlm-citation>
</ref>
<ref id="B4">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[El-Basil]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Theory and computational applications of Fibonacci graphs]]></article-title>
<source><![CDATA[Journal of Mathematical Chemistry]]></source>
<year>1988</year>
<volume>2</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>1-29</page-range></nlm-citation>
</ref>
<ref id="B5">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Euler]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The Fibonacci number of a grid graph and a new class of integer sequences]]></article-title>
<source><![CDATA[Journal of Integer Sequences]]></source>
<year>2005</year>
<volume>8</volume>
<numero>2</numero>
<issue>2</issue>
</nlm-citation>
</ref>
<ref id="B6">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Gutman]]></surname>
<given-names><![CDATA[I.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Topological properties of benzenoid systems IX on the sextet polynomial]]></article-title>
<source><![CDATA[Zeitschrift für Naturforschung A]]></source>
<year>1982</year>
<volume>37</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>69-73</page-range></nlm-citation>
</ref>
<ref id="B7">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Hosoya]]></surname>
<given-names><![CDATA[H.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Topological index and Fibonacci numbers with relation to chemistry]]></article-title>
<source><![CDATA[Fibonacci Quart]]></source>
<year>1973</year>
<volume>11</volume>
<numero>3</numero>
<issue>3</issue>
<page-range>255-66</page-range></nlm-citation>
</ref>
<ref id="B8">
<nlm-citation citation-type="confpro">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Lamm]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
<name>
<surname><![CDATA[Sanders]]></surname>
<given-names><![CDATA[P.]]></given-names>
</name>
<name>
<surname><![CDATA[Schulz]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Strash]]></surname>
<given-names><![CDATA[D.]]></given-names>
</name>
<name>
<surname><![CDATA[Werneck]]></surname>
<given-names><![CDATA[R. F.]]></given-names>
</name>
</person-group>
<source><![CDATA[Finding near-optimal independent sets at scale]]></source>
<year>2015</year>
<conf-name><![CDATA[ Eighteenth Workshop on Algorithm Engineering and Experiments]]></conf-name>
<conf-loc> </conf-loc>
<page-range>138-50</page-range></nlm-citation>
</ref>
<ref id="B9">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Merrifield]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Simmons]]></surname>
<given-names><![CDATA[H. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The structures of molecular topological spaces]]></article-title>
<source><![CDATA[Theoretica chimica acta]]></source>
<year>1980</year>
<volume>55</volume>
<numero>1</numero>
<issue>1</issue>
<page-range>55-75</page-range></nlm-citation>
</ref>
<ref id="B10">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Morrison]]></surname>
<given-names><![CDATA[D. R.]]></given-names>
</name>
<name>
<surname><![CDATA[Jacobson]]></surname>
<given-names><![CDATA[S. H.]]></given-names>
</name>
<name>
<surname><![CDATA[Sauppe]]></surname>
<given-names><![CDATA[J. J.]]></given-names>
</name>
<name>
<surname><![CDATA[Sewell]]></surname>
<given-names><![CDATA[E. C.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Branch-and-bound algorithms: A survey of recent advances in searching, branching, and pruning]]></article-title>
<source><![CDATA[Discrete Optimization]]></source>
<year>2016</year>
<volume>19</volume>
<page-range>79-102</page-range></nlm-citation>
</ref>
<ref id="B11">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Okamoto]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Uno]]></surname>
<given-names><![CDATA[T.]]></given-names>
</name>
<name>
<surname><![CDATA[Uehara]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
</person-group>
<source><![CDATA[Linear-time counting algorithms for independent sets in chordal graphs]]></source>
<year>2005</year>
<page-range>433-44</page-range></nlm-citation>
</ref>
<ref id="B12">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Samotij]]></surname>
<given-names><![CDATA[W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Counting independent sets in graphs]]></article-title>
<source><![CDATA[European Journal of Combinatorics]]></source>
<year>2015</year>
<volume>48</volume>
<page-range>5-18</page-range></nlm-citation>
</ref>
<ref id="B13">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Simmons]]></surname>
<given-names><![CDATA[H. E.]]></given-names>
</name>
<name>
<surname><![CDATA[Merrifield]]></surname>
<given-names><![CDATA[R. E.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Mathematical description of molecular structure: Molecular topology]]></article-title>
<source><![CDATA[Proceedings of the National Academy of Sciences]]></source>
<year>1977</year>
<volume>74</volume>
<numero>7</numero>
<issue>7</issue>
<page-range>2616-9</page-range></nlm-citation>
</ref>
<ref id="B14">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vadhan]]></surname>
<given-names><![CDATA[S. P.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[The complexity of counting in sparse, regular, and planar graphs]]></article-title>
<source><![CDATA[SIAM Journal on Computing]]></source>
<year>2001</year>
<volume>31</volume>
<numero>2</numero>
<issue>2</issue>
<page-range>398-427</page-range></nlm-citation>
</ref>
<ref id="B15">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Vesel]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Fibonacci dimension of the resonance graphs of catacondensed benzenoid graphs]]></article-title>
<source><![CDATA[Discrete Applied Mathematics]]></source>
<year>2013</year>
<volume>161</volume>
<numero>13</numero>
<issue>13</issue>
<page-range>2158-68</page-range></nlm-citation>
</ref>
<ref id="B16">
<nlm-citation citation-type="">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Wurtz]]></surname>
<given-names><![CDATA[J.]]></given-names>
</name>
<name>
<surname><![CDATA[Lopes]]></surname>
<given-names><![CDATA[P. L. S.]]></given-names>
</name>
<name>
<surname><![CDATA[Gorgulla]]></surname>
<given-names><![CDATA[C.]]></given-names>
</name>
<name>
<surname><![CDATA[Gemelke]]></surname>
<given-names><![CDATA[N.]]></given-names>
</name>
<name>
<surname><![CDATA[Keesling]]></surname>
<given-names><![CDATA[A.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[S.]]></given-names>
</name>
</person-group>
<source><![CDATA[Industry applications of neutral-atom quantum computing solving independent set problems]]></source>
<year>2022</year>
</nlm-citation>
</ref>
<ref id="B17">
<nlm-citation citation-type="journal">
<person-group person-group-type="author">
<name>
<surname><![CDATA[Yin]]></surname>
<given-names><![CDATA[X. F.]]></given-names>
</name>
<name>
<surname><![CDATA[Yao]]></surname>
<given-names><![CDATA[X. C.]]></given-names>
</name>
<name>
<surname><![CDATA[Wu]]></surname>
<given-names><![CDATA[B.]]></given-names>
</name>
<name>
<surname><![CDATA[Fei]]></surname>
<given-names><![CDATA[Y. Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Mao]]></surname>
<given-names><![CDATA[Y.]]></given-names>
</name>
<name>
<surname><![CDATA[Zhang]]></surname>
<given-names><![CDATA[R.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[L. Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Wang]]></surname>
<given-names><![CDATA[Z.]]></given-names>
</name>
<name>
<surname><![CDATA[Li]]></surname>
<given-names><![CDATA[L.]]></given-names>
</name>
<name>
<surname><![CDATA[Liu]]></surname>
<given-names><![CDATA[N. L.]]></given-names>
</name>
<name>
<surname><![CDATA[Wilczek]]></surname>
<given-names><![CDATA[F.]]></given-names>
</name>
<name>
<surname><![CDATA[Chen]]></surname>
<given-names><![CDATA[Y. A.]]></given-names>
</name>
<name>
<surname><![CDATA[Pan]]></surname>
<given-names><![CDATA[J. W.]]></given-names>
</name>
</person-group>
<article-title xml:lang=""><![CDATA[Solving independent set problems with photonic quantum circuits]]></article-title>
<source><![CDATA[Proceedings of the National Academy of Sciences]]></source>
<year>2023</year>
<volume>120</volume>
<numero>22</numero>
<issue>22</issue>
</nlm-citation>
</ref>
</ref-list>
</back>
</article>
