Which valence connectivities realize monocyclic molecules: Generating algorithm and its application to test discriminative properties of the Zagreb and modified Zagreb indices
|
 |
|
Post a Comment
|
 |
|
|
|
|
ABSTRACT:
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.
|
|
|
|
STATISTICS
|
|
Click on # to view
|
|
Citations
|
|
0
|
|
References
|
|
1
|
|
Comments
|
|
0
|
|
Quality
|
|
0/0.00
|
|
Interest
|
|
0/0.00
|
|
View(er)s
|
|
1/196
|
|
|
|
|
|
|
| Prev |
Next |
|