Which valence connectivities realize monocyclic molecules: Generating algorithm and its application to test discriminative properties of the Zagreb and modified Zagreb indices

摘要

Valence connectivities in hydrogen suppressed graphs are characterized by 10-tuples of quantities m(ij) where m(ij) is the number of edges that connect vertices of valences i and j. It is shown which 10-tuples are realizable by monocyclic graphs and this finding is used to compare discriminative properties of the Zagreb and modified Zagreb indices.