Graph operations

Graph operations produce new graphs from initial ones. They may be separated into the following major categories.

Unary operations

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

Elementary operations

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

Advanced operations create a new graph from one initial one by a complex changes, such as:

Binary operations

Binary operations create a new graph from two initial graphsG1 = (V1, E1) and G2 = (V2, E2), such as:

  • graph union: G1 ∪ G2. There are two definitions. In the most common one, the disjoint union of graphs, the union is assumed to be disjoint. Less commonly (though more consistent with the general definition of union in mathematics) the union of two graphs is defined as the graph (V1 ∪ V2, E1 ∪ E2).
  • graph intersection: G1 ∩ G2 = (V1 ∩ V2, E1 ∩ E2);[1]
  • graph join: graph with all the edges that connect the vertices of the first graph with the vertices of the second graph. It is a commutative operation (for unlabelled graphs);[2]
  • graph products based on the cartesian product of the vertex sets:
    • cartesian graph product: it is a commutative and associative operation (for unlabelled graphs),[2]
    • lexicographic graph product (or graph composition): it is an associative (for unlabelled graphs) and non-commutative operation,[2]
    • strong graph product: it is a commutative and associative operation (for unlabelled graphs),
    • tensor graph product (or direct graph product, categorical graph product, cardinal graph product, Kronecker graph product): it is a commutative and associative operation (for unlabelled graphs),
    • zig-zag graph product;[3]
  • graph product based on other products:
    • rooted graph product: it is an associative operation (for unlabelled but rooted graphs),
    • corona graph product: it is a non-commutative operation;[4]
  • series-parallel graph composition:
    • parallel graph composition: it is a commutative operation (for unlabelled graphs),
    • series graph composition: it is a non-commutative operation,
    • source graph composition: it is a commutative operation (for unlabelled graphs);
  • Hajós construction.

Notes
  1. Bondy, J. A.; Murty, U. S. R. (2008). Graph Theory. Graduate Texts in Mathematics. Springer. p. 29. ISBN 978-1-84628-969-9.
  2. Harary, F. Graph Theory. Reading, MA: Addison-Wesley, 1994.
  3. Reingold, O.; Vadhan, S.; Wigderson, A. (2002). "Entropy waves, the zig-zag graph product, and new constant-degree expanders". Annals of Mathematics. 155 (1): 157–187. arXiv:math/0406038. doi:10.2307/3062153. JSTOR 3062153. MR 1888797.
  4. Frucht, Robert; Harary, Frank (1970). "On the corona of two graphs". Aequationes Mathematicae. 4: 322–324. doi:10.1007/bf01844162. hdl:2027.42/44326.
gollark: Yes, it's a CPU architecture.
gollark: You can still get computers with that. Very expensive workstations.
gollark: PowerPC?
gollark: I mean, computers are fast and small VPSes can happily serve a few thousand req/s with good software.
gollark: I don't think most individuals actually have stuff which needs that much scaling?
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.