Dobrynin inidces

Share:

Description

This function calculates a set of basic descriptors intruduced by Skorobogatov and Dobrynin.

Usage

1

Arguments

g

a graph as a graphNEL object.

dist

the distance matrix of the graph. If the parameter is empty the distance matrix will be calculated within the function.

Details

This methods calculates 14 basic descriptors intruduced by Skorobogatov and Dobrynin.

Value

This function return a list containing the 14 descriptors.

eccentricityVertex

Eccentricity of all vertices

eccentricityGraph

Eccentricity of a graph

avgeccOfG

Average eccentricity of a graph

ecentricVertex

Eccentric of all vertices

ecentricGraph

Eccentric of a graph

vertexCentrality

Vertex centrality

graphIntegration

Graph integration

unipolarity

Unipolarity of a graph

vertexDeviation

Deviation of all vertices

variation

Variation of a graph

centralization

Centralization of a graph

avgDistance

Average distance of a graph

distVertexDeviation

Distance vertex deviation

meanDistVertexDeviation

Mean distance vertex deviation

Author(s)

Laurin Mueller

References

Skorobogatov V.A. and Dobrynin A.A., Metric analysis of graphs, match, pp. 105-151, 1988.

Examples

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

dobrynin(g)

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