Finds the size of the largest clique (complete subgraph) in the network.
Also known as the clique number or omega of the graph.
Usage
network_clique_size(x, ...)
Value
Integer: size of the largest clique
Arguments
x
Network input: matrix, igraph, network, cograph_network, or tna object
...
Passed to to_igraph, whose only other argument
is directed; anything else raises an "unused argument" error.
Details
A clique is defined on undirected ties, so a directed network is read with
each pair of nodes joined when either direction is present, and loops and
repeated edges are dropped before counting.