The Chromatic Information Index

Two types of information indices resulted from the statistical analysis of the distance matrix D(G) made by Bonchev and Trinajstic 34). Proceeding from Eq. (26), one can come to two distance partitions. In the first one, Pd, the total number of distances is partitioned into classes of distances, according to their equality or non-equality  

The respective information indices for the equality of distances, Ip, and for the magnitude of distances, Id, are calculated by the equations  

4 Information Analogous with the Randic and Hosoya Indices 

The distribution of the Hosoya Z index into its constituent non-adjacent numbers p(G, k)  

The information analogue of the Randic index, %R, was defined 83) by partitioning the graph edges into classes, depending on the equality of their partial connectivity 

---

The chromatic information index (or vertex chromatic information index) [Mow-showitz, 1968d] is the minimum value of the mean information content of all possible vertex chromatic decompositions with a number of colours equal to the vertex chromatic number and is defined as ... 

Information-theoretic indices, including the Shannon index, the chromatic information index, the orbital information index, the topological information superindex, the electropy index, and the Merrifield and Sinmions indices [13,14]. 

---