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 mij where mij 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
