On some algorithms for computing topological indices of chemical graphs

MaRDI QIDQ5156382zbMATH OpenFDO

Authors Aleksandar Ilić, Milovan Ilić

Publication date 15 October 2021

Full work available at URL https://match.pmf.kg.ac.rs/electronic_versions/Match78/n3/match78n3_665-674.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

• scientific article; zbMATH DE number 5642220
• Algorithms and extremal problem on Wiener polarity index
• scientific article; zbMATH DE number 6376885
• Distance property of chemical graphs
• Generalizations of some topological indices

Cited in

(13)

• On the Hosoya index of a family of deterministic recursive trees
• Peripheral Wiener index of trees and related questions
• Formula for calculating the Wiener polarity index with applications to benzenoid graphs and phenylenes
• The edge-Wiener index and the edge-hyper-Wiener index of phenylenes
• scientific article; zbMATH DE number 6700480 (Why is no real title available?)
• Edge-contributions of some topological indices and arboreality of molecular graphs
• scientific article; zbMATH DE number 4066948 (Why is no real title available?)
• Computation of graph vulnerability measures and topological indices
• scientific article; zbMATH DE number 7380509 (Why is no real title available?)
• Distance property of chemical graphs
• Linear-time algorithms for computing the Merrifield-Simmons index on polygonal trees
• A linear-time algorithm for the Hosoya index of an arbitrary tree
• On topological charge indices of graphs

This page was built for publication: On some algorithms for computing topological indices of chemical graphs

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