Year: 2002
Type: article
Abstract: The previous measures of the complexity of graphs, and thence molecular graphs, have been mainly based on the information content of graphs.We argue here that the two concepts, the information content of a graph and the graph complexity, are distinctive and should be differentiated.We propose a new index of molecular complexity which takes into account not only the connectivity and the closely associated structural features of molecular structure (e.g., branching, cyclicity) but also the symmetry of a molecule as the basis for the partitioning of molecular components considered for construction of the complexity measure of a graph.
Authors: Milan Randić, Dejan Plavšić
Institution: Ruđer Bošković Institute
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W156410507