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

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 <inline-formula><math dis...

Full description

Bibliographic Details
Main Authors: Naveed Ahmed Azam, Aleksandar Shurbevski, Hiroshi Nagamochi
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Entropy
Subjects:
trees
chemical graphs
enumeration
dynamic programming
polymer topology
Online Access:https://www.mdpi.com/1099-4300/22/9/923

Internet

https://www.mdpi.com/1099-4300/22/9/923

Similar Items