Jump to content

Graph operations

From Wikipedia, the free encyclopedia
This is an old revision of this page, as edited by Altenmann (talk | contribs) at 20:04, 8 March 2007 (Created page with '{{inprogress}} '''Operations on graphs''' produce new graph (mathematics)s from old ones. They may be separated into the following major categories. ==Unary...'). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.
(diff) ← Previous revision | Latest revision (diff) | Newer revision → (diff)

 In progress Operations on graphs produce new graphs from old ones. They may be separated into the following major categories.

Unary operations

Unary operations create a new graph from the old one:

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.

Advanced operations

Binary operations

Binary operations create new graph from two initial graphs: