Connectivity ID number considering shortest paths only
This method calculates a modified, faster version of the connectivity ID number.
a graph as a graphNEL object.
the degree of each node of g. Will be automatically calculated if not supplied.
This method works like the connectivityID method, but it only sums the weights of all the shortest paths in the graph. This results in different values only if the graph contains cycles.
O. Ivanciuc and A. Balaban. Design of Topological Indices. Part 3. New Identification Numbers for Chemical Structures: MINID and MINSID. Croatica chemica acta, 69:9-16, 1996
1 2 3 4