Linear-time algorithms for computing the Merrifield-Simmons index on polygonal trees

MaRDI QIDQ5156390zbMATH OpenFDO

Authors Guillermo de Ita Luna, J. Raymundo Marcial-Romero, P. Lopez, Meliza Contreras González

Publication date 15 October 2021

Full work available at URL https://match.pmf.kg.ac.rs/electronic_versions/Match79/n1/match79n1_55-78.pdf

Mathematics Subject Classification ID

Chemical graph theory (05C92) Computational methods for problems pertaining to biology (92-08) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Recommendations

• Algorithmic generation of molecular graphs with large Merrifield-Simmons index
• A Method for Computing the Merrifield–Simmons Index on Benzenoid Systems
• scientific article; zbMATH DE number 2188478
• Enumeration of independent sets in benzenoid chains
• On some algorithms for computing topological indices of chemical graphs

Cited in

(1)

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

This page was built for publication: Linear-time algorithms for computing the Merrifield-Simmons index on polygonal trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5156390)