table of Contents:
3. Introducing the combined expression
3. Introducing the combined expression
The difference between directed graph and undirected graph:
Four: completely undirected graph
One: Undirected graph
1. Definition
If the vertex
to
the edge between the no direction , this edge is called undirected edges (Edge)
Even with the disorder to
be represented
If the edges between any two vertices in the graph are undirected edges , then the graph is called an undirected graph
The number of edges of an undirected graph vertex is called degree
2. Graphical explanation
The following figure shows an undirected graph:
3. 
Introduction to combined expressions
Since the undirected graph is non-directional,
the edges connecting the vertices
Can be expressed as unordered pairs
Can also be written as
For the above figure undirected graph
is
Where the vertex set
Edge set
Two: directed graph
1. Definition
If there is a direction from the vertex
to
the edge , then this edge is called a directed edge , also called an arc (Arc)
Using ordered pair
to represent ,
called arc tail (Tail),
called the arc head (Head)
If the edges between any two vertices in the graph are all directed edges , then the graph is called a directed graph (Directed graphs)
The vertices of the directed graph are divided into in-degree (arrows toward themselves) and out-degrees (arrows toward outwards)
2. Graphical explanation
As shown in the figure below, it is a directed graph:
3. Introduction to combined expressions
Is connected to the apex
to
the rim is directed arc
Is arc tail
Is arc head
Represents an arc , note that it cannot be written as
For the directed graph above
Where the vertex set
Arc set
The difference between directed graph and undirected graph:
Note : See clearly, the undirected side is indicated by parentheses
And directed edges is the angle brackets
indicates
Three: simple diagram
1. Definition
In the drawing, if absent vertex to the edge of its own , and not repeated the same side , so called a simple graph of FIG.
2. Graphical explanation
Two as shown on FIG not simple FIG:
Four: completely undirected graph
1. Definition
In an undirected graph, if there are edges between any two vertices , the graph is called an undirected complete graph
2. Graphical explanation
As shown in the figure below, it is an undirected complete graph:
Five: directed complete graph
1. Definition
In a directed graph, if any between two vertices are present directions opposite to each other of the two arcs , the graph is said to have a complete graph to
2. Graphical explanation
The following figure is a directed complete graph:
table of Contents:
3. Introducing the combined expression
3. Introducing the combined expression
The difference between directed graph and undirected graph:
Four: completely undirected graph
One: Undirected graph
1. Definition
If the vertex
Even with the disorder to
If the edges between any two vertices in the graph are undirected edges , then the graph is called an undirected graph
The number of edges of an undirected graph vertex is called degree
2. Graphical explanation
The following figure shows an undirected graph:
3. Introduction to combined expressions
Since the undirected graph is non-directional,
Can be expressed as unordered pairs
Can also be written as
For the above figure undirected graph
Where the vertex set
Edge set
Two: directed graph
1. Definition
If there is a direction from the vertex
Using ordered pair
If the edges between any two vertices in the graph are all directed edges , then the graph is called a directed graph (Directed graphs)
The vertices of the directed graph are divided into in-degree (arrows toward themselves) and out-degrees (arrows toward outwards)
2. Graphical explanation
As shown in the figure below, it is a directed graph:
3. Introduction to combined expressions
Is connected to the apex
For the directed graph above
Where the vertex set
Arc set
The difference between directed graph and undirected graph:
Note : See clearly, the undirected side is indicated by parentheses
And directed edges is the angle brackets
Three: simple diagram
1. Definition
In the drawing, if absent vertex to the edge of its own , and not repeated the same side , so called a simple graph of FIG.
2. Graphical explanation
Two as shown on FIG not simple FIG:
Four: completely undirected graph
1. Definition
In an undirected graph, if there are edges between any two vertices , the graph is called an undirected complete graph
2. Graphical explanation
As shown in the figure below, it is an undirected complete graph:
Five: directed complete graph
1. Definition
In a directed graph, if any between two vertices are present directions opposite to each other of the two arcs , the graph is said to have a complete graph to
2. Graphical explanation
The following figure is a directed complete graph: