Enumerating Tree-Like Graphs and Polymer Topologies with a Given Cycle Rank

Cycle rank is an important notion that is widely used to classify, understand, and discover new chemical compounds. We propose a method to enumerate all non-isomorphic tree-like graphs of a given cycle rank with self-loops and no multiple edges. To achieve this, we develop an algorithm to enumerate...

Descripción completa

Detalles Bibliográficos
Autores principales: Azam, Naveed Ahmed, Shurbevski, Aleksandar, Nagamochi, Hiroshi
Formato: Online Artículo Texto
Lenguaje:English
Publicado: MDPI 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7711681/
https://www.ncbi.nlm.nih.gov/pubmed/33287063
http://dx.doi.org/10.3390/e22111295

Internet

https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7711681/
https://www.ncbi.nlm.nih.gov/pubmed/33287063
http://dx.doi.org/10.3390/e22111295

Ejemplares similares