Graph operations

In the mathematical field of graph theory, graph operations are operations which produce new graphs from initial ones.

Unary operations create a new graph from a single initial graph.

Elementary operations or editing operations, which are also known as graph edit operations, create a new graph from one initial one by a simple local change, such as addition or deletion of a vertex or of an edge, merging and splitting of vertices, edge contraction, etc.

The graph edit distance between a pair of graphs is the minimum number of elementary operations required to transform one graph into the other.

Advanced operations create a new graph from an initial one by a complex change, such as: Binary operations create a new graph from two initial graphs G1 = (V1, E1) and G2 = (V2, E2), such as: