# GraphSum

GraphSum[g1,g2]

gives the graph sum of the graphs g1 and g2.

# Details # Examples

open allclose all

## Basic Examples(2)

Sum of two graphs:

Generate complete graphs:

Graphs with parallel edges:

## Scope(29)

### Directed Graphs(5)

GraphSum works with directed graphs:

Simple directed graphs:

Directed multigraphs:

Directed weighted graphs:

Directed annotated graphs:

### Undirected Graphs(5)

GraphSum works with undirected graphs:

Simple undirected graphs:

Undirected multigraphs:

Undirected weighted graphs:

Undirected annotated graphs:

### Mixed Graphs(5)

GraphSum works with mixed graphs:

Simple mixed graphs:

Mixed multigraphs:

Mixed weighted graphs:

Mixed annotated graphs:

### Multigraphs(5)

GraphSum works with multigraphs:

Directed multigraphs:

Mixed multigraphs:

Weighted multigraphs:

Annotated multigraphs:

### Weighted Graphs(5)

GraphSum works with weighted graphs:

Directed weighted graphs:

Undirected weighted graphs:

Mixed weighted graphs:

Annotated weighted graphs:

### Special Graphs(4)

GraphSum works on entity graphs:

GraphSum works on trees:

Use rules to specify the graph:

GraphSum works with more than two graphs:

## Properties & Relations(5)

The sum of any graph and its complement is a CompleteGraph:

The sum of any graph and itself is a multigraph:

The sum of graphs can be obtained by joining the edges of the graphs:

The sum of graphs can be obtained by adding their adjacency matrices together:

GraphSum gives the same result as GraphUnion if graphs have different vertex names: