Professional Documents
Culture Documents
Fig 3-1.
In the Fig. 3-1 edge e 1 having same vertex as both its end vertices is called a selfloop. There may be more than one edge associated with a given pair of vertices, for
example e4 and e5 in Fig. 3-1. Such edges are referred to as parallel edges.
A graph that has neither self-loop nor parallel edges are called a simple graph,
otherwise it is called general graph. It should also be noted that, in drawing a graph,
it is immaterial whether the lines are drawn straight or curved, long or short: what is
important is the incidence between the edges and vertices.
A graph is also called a linear complex, a 1-complex, or a one-dimensional complex.
A vertex is also referred to as a node, a junction, a point, 0-cell, or an 0-simplex.
Other terms used for an edge are a branch, a line, an element, a 1-cell, an arc, and a 1simplex.
Because of its inherent simplicity, graph theory has a very wide range of applications
in engineering, physical, social, and biological sciences, linguistics, and in numerous
other areas. A graph can be used to represent almost any physical situation involving
discrete objects and a relationship among them.
Since each edge contributes two degrees, the sum of the degrees of all vertices in G is
twice the number of edges in G.
3.1.4 Isolated vertex, Pendent vertex, and Null graph
A vertex having no incident edge is called an isolated vertex. In other words, isolated
vertices are vertices with zero degree. Vertex v 4 and v7 in Fig. 3-2, for example, are
isolated vertices. A vertex of degree one is called a pendent vertex or an end vertex.
Vertex v3 in Fig. 3-2 is a pendant vertex. Two adjacent edges are said to be in series if
their common vertex is of degree two. In Fig. 3-2, the two edges incident on v 1 are in
series.
Fig. 3-2 Graph containing isolated vertices, series edges and a pendant vertex.
In the definition of a graph G = (V, E), it is possible for the edge set E to be empty.
Such a graph, without any edges, is called a null graph. In other words, every vertex
in a null graph is an isolated vertex. A null graph of six vertices is shown in Fig. 3-3.
Although the edge set E may be empty, the vertex set V must not be empty; otherwise,
there is no graph. In other words, by definition, a graph must have at least one vertex.
(a)
v1
v2
v3
v4
v5
v6
(b)
Fig. 3-4 Graph and its incidence matrix.
Such a matrix A is called the vertex-edge incidence matrix, or simply incidence
matrix. Matrix A for a graph G is sometimes also written as A(G). A graph and its
incidence matrix are shown in Fig. 3-4.
The concept of a tree is probably the most important in graph theory, especially for
those interested in applications of graphs.
A tree is a connected graph without any circuits. The graph in Fig 3-5 for instance, is
a tree. It follows immediately from the definition that a tree has to be a simple graph,
that is, having neither a self-loop nor parallel edges (because they both form circuits).
vertices we have n-1 edges, and hence 2(n-1) degrees to be divided among n vertices.
Since no vertex can be of zero degree, we must have at least two vertices of degree
one in a tree. This makes sense only if n 2.
Hamiltonian path: If we remove any one edge from a Hamiltonian circuit, we are left
with a path. This path is called a Hamiltonian path. Clearly, a Hamiltonian path in a
graph G traverses every vertex of G. Since a Hamiltonian path is a subgraph of a
Hamiltonian circuit (which in turn is a subgraph of another graph), every graph that
has a Hamiltonian circuit also has a Hamiltonian path. There are, however, many
graphs with Hamiltonian paths that have no Hamiltonian circuits. The length of a
Hamiltonian path in a connected graph of n vertices is n-1.
3.3.5 Traveling-Salesman Problem
A problem closely related to the question of Hamiltonian circuits is the Travelingsalesman problem, stated as follows: A salesman is required to visit a number of cities
during a trip. Given the distances between the cities, in what order should he travel so
as to visit every city precisely once and return home, with the minimum mileage
traveled?
Representing the cities by vertices and the roads between them by edges, we get a
graph. In this graph, with every edge ei there is associated a real number (the distance
in miles, say), w(ei). Such a graph is called a weighted graph; w(ei) being the weight
of edge ei.
In our problem, if each of the cities has a road to every other city, we have a complete
weighted graph. This graph has numerous Hamiltonian circuits, and we are to pick
the one that has the smallest sum of distances (or weights).
The total number of different (not edge disjoint, of course) Hamiltonian circuits in a
complete graph of n vertices can be shown to be (n-1)! / 2. This follows from the fact
that starting from any vertex we have n-1 edges to choose from the first vertex, n-2
from the second, n-3 from the third, and so on. These being independent, results with
(n-1)! choices. This number is, however, divided by 2, because each Hamiltonian
circuit has been counted twice.
Exercise 3
1. Draw all simple graphs of one, two, three and four vertices
2. Name 10 situations that can be represented by means of graphs. Explain
what each vertex and edge represent
3. Draw a connected graph that becomes disconnected when any edge is
removed from it
4. Draw all trees of n labeled vertices for n=1,2,3,4 and 5
5. Sketch all binary trees with six pendent edges
6. Sketch all spanning trees of given graphs in this chapter
7. Write incidence matrix for all the graphs developed
8. Find the spanning trees for all the graphs developed
9. Draw a graph which has Hamiltonian path but does not have Hamiltonian
circuit
10. List different paths from vertex1 to vertex n in each graph developed.