Operations on graphs
From Wikipedia, the free encyclopedia
Operations on graphs produce new graphs from old ones. They may be separated into the following major categories.
Contents |
[edit] Unary operations
Unary operations create a new graph from the old one.
[edit] Elementary operations
These are sometimes called "editing operations" on graphs. They create a new graph from the original one by a simple, local change, such as addition or deletion of a vertex or an edge, merging and splitting of vertices, etc.
[edit] Advanced operations
[edit] Binary operations
Binary operations create new graph from two initial graphs:
- The disjoint union of graphs is defined as follows. For two graphs G(V1, E1) and H(V2, E2) with disdjoint vertex sets V1 and V2 (and hence disdjoint edge sets), their disjdoint union is the graph U(V1 ∪ V2, (E1 ∪ E2).
- The sum of two graphs is ...
- The Difference of graphs is ...
- category:Graph products
- Cartesian product of graphs
- Tensor product of graphs
- Strong product of graphs
- Lexicographic product of graphs
- Zig-zag product of graphs
