Basic graph definitions: Difference between revisions
Jump to navigation
Jump to search
| Line 5: | Line 5: | ||
# A directed or undirected graph is '''simple''', if: | # A directed or undirected graph is '''simple''', if: | ||
## No node is paired with itself in <math>A</math> and <math>E</math>, respectively. | ## No node is paired with itself in <math>A</math> and <math>E</math>, respectively. | ||
## The multisets <math and , respectively, are sets. | ## The multisets <math>A</math> and <math>E</math>, respectively, are sets. | ||
# A directed graph <math>G=(V;A)</math> is '''symmetric''' if <math>(v,w)\in A</math> implies <math>(w,v)\in A</math>, and '''anti-symmetric''' if <math>(v,w)\in A</math> implies <math>(w,v)\not\in A</math>. | # A directed graph <math>G=(V;A)</math> is '''symmetric''' if <math>(v,w)\in A</math> implies <math>(w,v)\in A</math>, and '''anti-symmetric''' if <math>(v,w)\in A</math> implies <math>(w,v)\not\in A</math>. | ||
Revision as of 10:10, 20 October 2014
Directed and undirected graphs
- A directed graph [math]\displaystyle{ G=(V,A) }[/math] consists of a finite set [math]\displaystyle{ V }[/math] of nodes (a.k.a. vertices) and a multiset [math]\displaystyle{ A }[/math] of ordered pairs of nodes. The elements of [math]\displaystyle{ A }[/math] are the arcs of [math]\displaystyle{ G }[/math].
- An undirected graph [math]\displaystyle{ G=(V,E) }[/math] consists of a finite set [math]\displaystyle{ V }[/math] of nodes (a.k.a. vertices) and a multiset [math]\displaystyle{ E }[/math] of unordered pairs of nodes, the edges of [math]\displaystyle{ G }[/math].
- A directed or undirected graph is simple, if:
- No node is paired with itself in [math]\displaystyle{ A }[/math] and [math]\displaystyle{ E }[/math], respectively.
- The multisets [math]\displaystyle{ A }[/math] and [math]\displaystyle{ E }[/math], respectively, are sets.
- A directed graph [math]\displaystyle{ G=(V;A) }[/math] is symmetric if [math]\displaystyle{ (v,w)\in A }[/math] implies [math]\displaystyle{ (w,v)\in A }[/math], and anti-symmetric if [math]\displaystyle{ (v,w)\in A }[/math] implies [math]\displaystyle{ (w,v)\not\in A }[/math].
= Adjacency and incidence
- Two nodes of a directed or undirected graph are called adjacent if they share at least one arc/edge.
- A node and an arc/edge are called incident if the node belongs to the arc/edge.
- For a node, the number of incident arcs/edges is the degree of this node.
- Consider a directed graph and a node :
- An arc is an outgoing arc of , and an arc is an incoming arc of .
- The outdegree of is the number of its outgoing arcs, the indegree of is the number of its incoming arcs.
Representations of graphs
We focus on directed graphs because an undirected graph is usually represented as a symmetric directed graph as introduced above. Let and . We denote and .
- Adjacency matrix: an -matrix such that, for ,
if , and if .
- Incidence matrix: an -matrix such that, for and , it is
if for some , if for some ,
, otherwise.
- Incidence list: a sequence of length . For , is a sequence of arcs and contains all outgoing arcs of .
Connectedness
An undirected graph is said to be connected if, for each pair of nodes, there is a path connecting this pair. A directed graph is said to be weakly connected if, for each pair of nodes, there is a generalized path connecting this pair. A directed graph is said to be strongly connected if, for each pair of nodes, there is a path connecting this pair.