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...
Gorde:
| Egile Nagusiak: | , , |
|---|---|
| Formatua: | Artigo |
| Hizkuntza: | Inglês |
| Argitaratua: |
MDPI AG
2020-11-01
|
| Saila: | Entropy |
| Gaiak: | |
| Sarrera elektronikoa: | https://www.mdpi.com/1099-4300/22/11/1295 |
| Etiketak: |
Etiketarik gabe, Izan zaitez lehena erregistro honi etiketa jartzen!
|