Cs6702 Graph Theory and Applications Notes PDF Book - Compressed
Cs6702 Graph Theory and Applications Notes PDF Book - Compressed
such that (V, E))
and (V, Ep) are both bipartite.
© Proof. Let Vi =a ‘(i) be the set of vertices coloured by i in a proper 4-colouring a
of G.
© The define E; as the subset of the edges of G that are between the sets Vand
V2;V; and V4; Vs and V4.
© Let E be the rest of the edges, that is, they are between the sets V; and V3; V2 and
Vs; V2 and Vq. It is clear that (V, E1) and (V, Ez) are bipartite, since the sets Vj are
stable.'$6702_ GRAPH THEORY AND APPLICATI
© Map colouring*
* The 4-Colour Conjecture was originally stated for maps.
© In the map-colouring problem we are given several countries with common borders
and we wish to colour each country so that no neighboring countries obtain the
same colour.
© How many colors are needed?
© A border between two countries is assumed to have a positive length in
particular,countries that have only one point in common are not allowed in the map
colouring.
© Formally, we define a map as a connected planar (embedding of a) graph with no
bridges. The edges of this graph represent the boundaries between countries.
* Hence a country is a face of the map, and two neighbouring countries share a
common edge (not just a single vertex). We deny bridges, because a bridge in such a
‘map would be a boundary inside a country.
* The map-colouring problem is restated as follows,
* How many colours are needed for the faces of a plane embedding so that no
adjacent faces obtain the same colour.
© The illustrated map can be 4-coloured, and it cannot be coloured using only 3
colours, because every two faces have a common border.
© Colour map
© Leth, B
. Fu be the countries of a map M, and define a graph G with Ve = (v1,
V2... ++ Va} Such that viv; € G ifand only if the countries F; and Fyare neighbour's.
© It is easy to see that G is a planar graph. Using this notion of a dual graph, we can
state the map-colouring problem in new form:
© What is the chromatic number of a planar graph? By the 4-Colour Theorem it is at
most four.
© Map-colouring can be used in rather generic topological setting, where the maps are
defined by curves in the plane.($6702 GRAPH THEORY AND APPLICATIONS 47
* As an example, consider finitely many simple closed curves in the plane. These
curves divide the plane into regions. The regions are 2-colourable.
© That is, the graph where the vertices correspond to the regions, and the edges
comespond to the neighbourhood relation, is bipartite,
© To see this, colour a region by I, if the region is inside an odd number of curves,
and, otherwise, colour it by 2.
State five color theorem
Every planar map can be properly colored with five colors.
i.e., the vertices of every plannar graph can be properly colored with five colors
Vertex coloring and region coloring.
A gtaph has a dual if and only if it is planar. Therefore, coloring the regions of a
planar graph G is equivalent to coloring the vertices of its dual G** and vice versa.
Regularization of a planar graph
© Remove every vertex of degree one from the graph G does not affect the regions of
a plannar graph.
© Remove every vertex of degree two and merge the two edges in series from the
graph G.
© Such a transformation may be called regularization of a planar graph.
3.7. DIRECTED GRAPHS
A directed graph (or a digraph, or an oriented graph) G consists of a set of vertices V = {
Vj, Vo, so Jy a set of edges E = [ ¢1, e2, ... }, and a mapping ¥ that maps every edge onto
some ordered pa
of vertices (¥, 1)
For example,isomorphic digraph,
Among directed graphs, if their labels are removed, two isomorphic graphs are
indistinguishable then these graphs are isomorphic digraph.
For example,
te ome y a3 ¢
at. To}
vs % b d
‘Two isomorphic digraphs.
4 6
a
3.8 TYPI
p
OF DIRECTED GRAPHS
Like undirected graphs , digraphs are also has so many verities. In fact, due to the choice of
assigning a direction to cach edge, directed graphs have more varieties than undirected
ones.
Simple Digraphs:
A digraph that has no self-Loop or parallel edges is called a simple digraph .
Asymmetric Digraphs:(86702 GRAPH THEORY AND APPLICATIONS. 9
Digraphs that have at most one directed edge between a pair of vertices, but are allowed to
have self-loops, are called asymmetric or antisymmetric.
Symmetric Digraphs:
Digraphs in which for every edge (a, b) (Le., from vertex a to b) there is also an edge (b, 2).
A digraph that is both
Similarly, a digraph that is both simple and asymmetric is simple asymmetric.
imple and. symmetric
called a simple symmetric digraph.
The reason for the terms symmetric and asymmetric will be apparent in the context of
binary relations.
‘Complete Digraphs:
A complete undirected graph was defined as a simple graph in which every vertex is joined
to every other vertex exactly by one edge
For digraphs we have two types of complete graphs.
‘A complete symmetric digraph is a simple digraph in which there is exactly one edge
directed from every vertex to every other vertex, and a complete asymmetric digraph is an
asymmetric digraph in which there is exactly one edge between every pair of vertices.
A complete asymmetric digraph of n vertices contains n(n - 1/2 edges, but a complete
symmetric digraph of n vertices contains n(n - 1) edges. A complete asymmetric digraph is
also called a tournament or a complete tournament (the reason for this term will be made
clear).
A digraph is said to be balanced if for every vertex v, the in-degree equals the out-degree;
that is, d+(vi) = div,). (A balanced digraph is also referred to as a pseudo symmetric
digraph. or an isograph.) A balanced digraph is said to be regular if every vertex has the
same i
degree and out-degree as every other vertex.
Complete symmetric digraph of four vertices3.9 DIGRAPHS AND BINARY RELATIONS
In a set of objects, X, where X={x1, x2, ...}, A binary relation R between pairs (xi, 4) can
be written as.x; R.xj and say that xy has relation R to 3,
Tf the binary relation R is reflexive, symmetric, and transitive then Ris an
equivalence relation, This produces equivalence classes.
Let A and B be nonempty sets. A (binary) relation R from A to B is a subset of A x B. IfR.
AxB andta,b) © R, wherea © A,b © B, we say ais related to" b by R, and we
write aRb, If a is not related to b by R, we write a0 b. A relation R defined on a set X is a
subset of X x X.
For example, less than, greater than and equality are the relations in the set of real numbers.
The property “is congruent to" defines a relation in the set of all triangles in a plane. Also,
parallelism defines a relation in the set of all lines in a plane.
Let R define a relation on a non empty set X. If R relates every element of X to itself, the
relation R is said to be reflexive. A relation R is said to be symmetric if for all xx; © x,
x; R xj implies x; R x;. A relation R is said to be transitive if for any three elements x, xj and
x, in X, x,Rx, and x; R xy imply xi /2 xy. A binary relation is called an equivalence relation
if itis reflexive, symmetric and transitive.
A binary relation Ron a set X can always be represented by a digraph, In such a
representation, each x; E X is represented by a vertex xi and whenever there is a relation R
from xi to xj, an are is drawn from xi to xj, for every pair (xi, x). The digraph in Figure
represents the relation is less than, on a set consisting of four numbers 2, 3 4, 6.
We note that every binary relation on a finite set can be represented by a digraph without
parallel edges and vice versa, Clearly, the digraph of a reflexive relation contains a loop at
every vertex Fig. A digraph representing a reflexive binary relation is called a reflexive
digraph.
Gv, H(Subgraph of) G-v(H) GEG)Example
‘The digraph of a symmetric relation is
ymmetrie digraph because for every arc from x,to
x,, there is an are from x; to x; . Figure shows the digraph of an irreflexive and symmetric
relation on a set of three elements.
[IL IE
Graph G Gre Gey
cy o) ©
Example
A digraph representing transitive relation on its vertex set is called a transitive digraph
Figure shows the digraph of a transitive, which is neither reflexive, nor symmetric.
Example
A binary relation R on a set M can also be represented by a matrix, called a relation matrix.
This is a (0, 1), nxn matrix Mp = [mj], where n is the number of elements in M, and is
defined by
mal) if Rxyis true,
US 0, otherwise.
In some problems the relation between the objects is not symmetric. For these cases we
need directed graphs, where the edges are oriented from one vertex to another.
Defi
A digraph (or a directed graph) D = (Vp, Ep) consists of the vertices Vp and (directed)
eXges Ep © Vp X Vp (without loops wv).
We still write uv for (u,v), but note that now uv 7 vu.
For each pair e = uv define the inverse of e as e! = vu (= (v, w)).
Note that e € D does not imply e' € D.
Let D be a digraph. Then A is its further classified into:
Subdigraph, if VS Vp and Ea © Ep,
Induced subdigraph, A = D[X], if VA = X and Ba = Bp 1 (X *X).52
‘The underlying graph U(D) of a digraph D is the graph on Vpsuch that if ¢ € D, then the
undirected edge with the same ends is in U(D).
of a graph G, if G = UD) and e € D implies ¢'/e D.
A digraph D is an orient:
In this case, D is said to be an oriented graph.
Wav
Example
3.10 DIRECTED PATHS AND CONNECTEDNESS
A path in a directed graph is called Directed path.
Vs €6 99 €6 Ya es ¥y is a directed path from vst0 1
Whereas vs ¢7 v4 &6 v3 e) vj i8 a semi-path from vs to v.
«Strongly connected digraph: A digraph G is said to be strongly connected if
there is at least one directed path from every vertex to every other vertex.
Weakly connected digraph: A digraph G is said to be weakly connected if its
corresponding undirected graph
connected. But G is not strongly connected
The relationship between paths and directed paths is in general rather complicated. This
digraph has a path of length five, but its directed paths are of length one.
There is a nice connection between the lengths of directed paths and the chromatic
number Xp) = Xun)Example
‘Theorem : A digraph D has a directed path of length 4 (D) ~1.
Proof. Let A'S Ep be a minimal set of edges such that the subdigraph D-A contains no
directed eycles.
Let k be the length of the longest directed path in D~A
For each vertex v € D, assign a colour a() =i, ifa longest directed path from v has length i
=Lin D-A. Here |