A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems

DOI10.46793/match.89-1.245IzbMath1505.92274OpenAlexW4293404550MaRDI QIDQ5050764

Meliza Contreras, Pedro Bello, Guillermo de Ita

Publication date: 17 November 2022

Published in: MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.46793/match.89-1.245i

Mathematics Subject Classification ID

Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Maxima and minima of the Hosoya index and the Merrifield-Simmons index
• A linear-time algorithm for drawing a planar graph on a grid
• How to draw a planar graph on a grid
• Planar lattice gases with nearest-neighbor exclusion
• Clique polynomials and independent set polynomials of graphs
• The complexity of counting colourings and independent sets in sparse graphs and hypergraphs
• Counting models for 2SAT and 3SAT formulae
• Merrifield-Simmons index and its entropy of the 4-8-8 lattice
• Computing the Merrifield-Simmons indices of benzenoid chains and double benzenoid chains
• The smallest Merrifield-Simmons index of \((n,n+1)\)-graphs
• The Complexity of Counting in Sparse, Regular, and Planar Graphs
• Corrigendum: The complexity of counting graph homomorphisms
• The Number of Independent Sets in a Regular Graph
• The Number of Independent Sets in a Grid Graph
• Efficient coding schemes for the hard-square model
• Principles and Practice of Constraint Programming – CP 2003
• Graph-Theoretic Concepts in Computer Science
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems