<< graph_center Graphs - Nets graph_data_structure >>

metanet >> metanet > Graphs - Nets > graph_complement

graph_complement

complement of a graph

Calling Sequence

g1 = graph_complement(g,[gmax])

Parameters

g

a graph_data_structure.

gmax

:a optional graph data structure.

g1

graph data structure of the new graph

Description

The complement of a graph g is the graph g1 with the same node set but whose edge set consists of the edges not present in g (i.e., the complement of the edge set of g with respect to all possible edges on the vertex set of G).

graph_complement returns the undirected graph g1 which is the complement of the graph g with respect to the corresponding complete graph. When gmax is given, the complement is made with respect to gmax. g and gmax are supposed to be simple graphs (use graph_simp before calling graph_complement if necessary) and to have the same number of nodes.

Examples

ta=[1 1 2 2 2 3 4 5 5 7 8 8 9 10 10 10 10 11 12 13 13 13 14 15 17 17 16 16];
he=[2 10 3 5 7 4 2 4 6 8 6 9 7 7 11 13 15 12 13 9 10 14 11 16 14 15 1 17];
g=make_graph('foo',1,17,ta,he);
g.nodes.graphics.x=[283 163 63 57 164 164 273 271 339 384 504 513 439 623 631 757 642];
g.nodes.graphics.y=[59 133 223 318 227 319 221 324 432 141 209 319 428 443 187 151 301];
show_graph(g);
g1=graph_complement(g);
show_graph(g1,'new');
g=graph_complement(g1);
show_graph(g,'new');

See Also


Report an issue
<< graph_center Graphs - Nets graph_data_structure >>