Finds the complementary graph of an undirected graph.
Usage
cmpGraph(amat)
Value
the edge matrix of the complementary graph.
Arguments
amat
the adjacency matrix of an undirected graph
Author
Giovanni M. Marchetti
Details
The complementary graph of an UG is the graph that has the same set
of nodes and an undirected edge connecting \(i\) and \(j\)
whenever there is not an \((i,j)\) edge in the original UG.
References
Lauritzen, S. (1996). Graphical models. Oxford:
Clarendon Press.