These functions return values or vectors relating to how connected a network is and where the nodes or edges that would increase fragmentation are.

graph_density(object)

graph_components(object)

graph_cohesion(object)

graph_diameter(object)

graph_length(object)

## Arguments

object

An object of a migraph-consistent class:

• matrix (adjacency or incidence) from {base} R

• edgelist, a data frame from {base} R or tibble from {tibble}

• igraph, from the {igraph} package

• network, from the {network} package

• tbl_graph, from the {tidygraph} package

## Functions

• graph_density: summarises the ratio of ties to the number of possible ties.

• graph_components: Returns number of (strong) components in the network. To get the 'weak' components of a directed graph, please use to_undirected() first.

• graph_cohesion: Returns the minimum number of nodes to remove from the network needed to increase the number of components.

• graph_adhesion: Returns the minimum number of edges needed to remove from the network to increase the number of components.

• graph_diameter: Returns the maximum path length in the network.

• graph_length: Returns the average path length in the network.

## References

White, Douglas R and Frank Harary. 2001. "The Cohesiveness of Blocks In Social Networks: Node Connectivity and Conditional Density." Sociological Methodology 31(1): 305-59.

Other measures: centralisation, centrality, closure, diversity, features, holes

## Examples

graph_density(mpn_elite_mex)
#> [1] 0.197
#> [1] 0.164
graph_cohesion(ison_marvel_relationships)
#> [1] 0
graph_cohesion(to_main_component(ison_marvel_relationships))
#> [1] 5