The complementary graph
Finds the complementary graph of an undirected graph.
cmpGraph(amat)
amat |
the adjacency matrix of an undirected graph |
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.
the edge matrix of the complementary graph.
Giovanni M. Marchetti
Lauritzen, S. (1996). Graphical models. Oxford: Clarendon Press.
## A chordless four-cycle four <- UG(~ a*b + b*d + d*e + e*a) four cmpGraph(four)
Please choose more modern alternatives, such as Google Chrome or Mozilla Firefox.