Distance-sum-connectivity matrix

Share:

Description

This method calculates the distance-sum-connectivity matrix of a given graph.

Usage

1

Arguments

g

a graph as a graphNEL object.

dist

the pre-computed distance matrix of the graph. Will be calculated automatically if NULL.

Value

This method returns the distance-sum-connectivity matrix of a given graph. This is an adjacency matrix where each edge is weighted according to the reciprocal square root of the product of the adjacent vertices' distance sum.

Author(s)

Michael Schutte

References

K. Szymanski, W. Mueller, J. Knop, and N. Trinajsti\'c. On the Identification Numbers for Chemical Structures. International Journal of Quantum Chemistry, 30(S20):173-183, 1986

Examples

1
2
3
4
5
library(RBGL)
set.seed(123)
g <- randomGraph(1:8, 1:5, 0.36, weights=FALSE)

distSumConnectMatrix(g)

Want to suggest features or report bugs for rdrr.io? Use the GitHub issue tracker.