Cargando…

An Efficient Algorithm to Count Tree-Like Graphs with a Given Number of Vertices and Self-Loops

Graph enumeration with given constraints is an interesting problem considered to be one of the fundamental problems in graph theory, with many applications in natural sciences and engineering such as bio-informatics and computational chemistry. For any two integers [Formula: see text] and [Formula:...

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:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7597174/
https://www.ncbi.nlm.nih.gov/pubmed/33286692
http://dx.doi.org/10.3390/e22090923