crossclique: Find the cross-clique connectivity (centrality)
Description
The cross-clique connectivity \(X(v)\) of a node is the number of cliques to which belongs. A node with a high \(X(v)\) value is called a highly cross-connected node.
Usage
crossclique(graph, vids = V(graph))
Arguments
graph
The input graph as igraph object
vids
Vertex sequence, the vertices for which the centrality values are returned. Default is all vertices.
Value
A numeric vector contaning the centrality scores for the selected vertices.
Details
Note: Directed graph considered as undirected ones and multiple edges and loops are ignored.
More detail at Cross-Clique Connectivity
References
Faghani, M., and U. Nguyen. "A Study of XSS Worm Propagation and Detection Mechanisms in Online Social Networks." (2013): 1-1.