𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Chemical graphs with degenerate topological indices based on information on distances

✍ Scribed by Ovidiu Ivanciuc; Teodor-Silviu Balaban; Alexandru T. Balaban

Publisher
Springer
Year
1993
Tongue
English
Weight
631 KB
Volume
14
Category
Article
ISSN
0259-9791

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Unique description of chemical structure
Unique description of chemical structures based on hierarchically ordered extended connectivities (HOC procedures). V. New topological indices, ordering of graphs, and recognition of graph similarity
✍ Ovanes Mekenyan; Danail Bonchev; Alexandru T. Balaban πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 774 KB

The vertex numbering obtained by application of the HOC algorithm can be converted into two sequences of numbers: If each vertex starting with vertex 1 is only counted once, the sums of numberings of adjacent vertices form sequence S, ( i = 1-N), while the sums of S, values form sequence MI ( i = 1-