Module 2
Module 2
Module 2
Contents
2.1
34
2.2
Connected graphs . . . . . . . . . . . . . . . . . . . . . . .
39
Distance . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
43
44
Blocks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . .
47
2.3
Connectivity . . . . . . . . . . . . . . . . . . . . . . . . . .
50
2.4
56
Weighted graphs . . . . . . . . . . . . . . . . . . . . . . . .
56
58
61
Exercises
. . . . . . . . . . . . . . . . . . . . . . . . . . . .
33
66
34
and physical links connecting certain pairs of nodes. One of the network problems
is to move objects (messages/liquids/vehicles) between two given nodes in shortest
possible time (or distance).
This real world problem can be easily modeled as a graph theoretic problem.
Figure 2.1 shows a communication network with five nodes, each of which is represented by a vertex. An edge represents a direct link. The integer along an edge
represents the time to send a message along that link.
v2
1
6
3
v1
8
v3
4
v5
2
v4
Figure 2.1: A communication network.
By examining all possible paths from v1 to v4 , we find that the shortest route
to send a message from v1 to v4 is along the path (v1 , v2 , v5 , v4 ) and it takes six units
of time. There exist good algorithms to find shortest paths which avoid brute force
method of examining all paths between two vertices.
2.1
35
W (v0 , vt ) = (v0 , e1 , v1 , e2 , v2 , . . . , et , vt )
of vertices and edges such that ei is an edge incident with vertices vi1 and
vi , i = 1, 2, . . . , t.
v0 is called the origin and vt is called the terminus. Other vertices are called
the internal vertices. Note that v0 and vt can also be internal vertices.
The length of W is the number of edges it contains where an edge is counted
as many times as it occurs.
W is called a closed walk, if v0 = vt .
Remarks.
In a walk, vertices and edges may appear any number of times.
If there exists a (v0 , vt )-walk, then there exists a (vt , v0 )-walk.
If G is a simple graph, W is denoted as a sequence of vertices (v0 , v1 , . . . , vt )
with the understanding that (vi , vi+1 ) is an edge, for i = 0, 1, . . . , t 1.
Definitions.
A (v0 , vt )-walk is called a (v0 , vt )-trail, if no edge is repeated (but vertices may
get repeated). It is called a closed trail if v0 = vt .
A (v0 , vt )-walk is called a (v0 , vt )-path, if no vertex is repeated (and therefore
no edge is repeated).
By definition, every path is a trail and every trail is a walk. However, a walk
need not be a trail and a trail need not be a path.
A closed walk W (v0 , vt ) is called a cycle, if all its vertices are distinct except
that v0 = vt .
A cycle with k vertices is called a k-cycle and it is denoted by Ck . A C3 is also a
K3 and it is referred to as a triangle. A 1-cycle is a loop and a 2-cycle consists
of two multiple edges.
36
e4
e2
e6
v3
e5
e3
v5
e7
v4
Figure 2.2: A graph G.
Define:
(1) W1 (v1 , v5 ) = (v1 , e1 , v2 , e4 , v3 , e2 , v1 , e3 , v4 , e5 , v3 , e4 , v2 , e6 , v5 ).
(2) W2 (v1 , v5 ) = (v1 , e1 , v2 , e4 , v3 , e2 , v1 , e3 , v4 , e7 , v5 ).
(3) W3 (v1 , v5 ) = (v1 , e1 , v2 , e4 , v3 , e5 , v4 , e7 , v5 ).
(4) W4 (v1 , v1 ) = (v1 , e1 , v2 , e4 , v3 , e2 , v1 , e3 , v4 , e5 , v3 , e2 , v1 ).
(5) W5 (v1 , v1 ) = (v1 , e1 , v2 , e4 , v3 , e5 , v4 , e3 , v1 ).
Here, W1 is a (v1 , v5 )-walk of length 7. It is not a trail. W2 is a trail of length
5 but it is not a path. W3 is a path of length 4. W4 is a closed walk of length 6 but
it is not a cycle. W5 is a cycle of length 4. As per our convention, W5 is also denoted
by (v1 , v2 , v3 , v4 , v1 ).
Theorem 2.1. Every (v0 , vt )-walk W contains a (v0 , vt )-path.
Proof. Among all (v0 , vt )-subwalks of W , let P (v0 , vt ) be a subwalk of W which has
minimum length. We claim that P is a path. Otherwise, there exist i and j (say
i < j) such that vi = vj . That is,
P (v0 , vt ) = (v0 , . . . , vi , ei+1 , vi+1 , . . . , vj (= vi ), ej+1 , vj+1 , . . . , vt ).
37
v2
vk
vt
38
Pn
Cn
n
n
Kn
3
n
c
Km
+ Knc
4
2 min{m, n}
Qn
4
2n
P
5
9
39
u1 u2 u3
two vertices in {u1 , u2 , u3 } are adjacent, then u1 , u2 , u3 are three mutually adjacent
vertices. So, (i) or (ii) holds.
The above theorem can be reformulated as follows:
Theorem 2.5. If G is a simple graph on at least six vertices, then either K3 G or
K3 Gc .
Remarks.
The assumption n 6 made in Theorem 2.4 is necessary. For example, C5 is a
graph on five vertices which satisfies neither (i) nor (ii).
Which of the problems stated at the beginning of this course is now solved?
2.2
Connected graphs
Clearly, we can move objects between two nodes if they are connected.
Definitions.
In a graph G, two vertices u and v are said to be connected, if there exists a
(u, v)-path.
G is said to be a connected graph if any two vertices are connected; else, G
is said to be a disconnected graph.
A maximal connected subgraph H of a graph G is called a component of G;
maximal in the sense that if H1 is a connected subgraph of G such that H H1 ,
then H = H1 .
40
(a) H1
(b) H2
Figure 2.6: Two subgraphs of G which are not its components; they are connected
subgraphs but not maximal connected subgraphs.
Theorem 2.6. For any graph G, m(G) n(G) c(G).
Proof. We prove the theorem by induction on n.
Basic step: If n = 1, the result is obvious.
Induction step: If (G) 2, then m(G) =
1
2
d(v)
21 (2n(G)) = n(G) >
vV (G)
P
41
Next assume that (G) = 1, and let v be a vertex of degree 1. Then c(G v) = c(G).
So,
m(G) = m(G v) + 1
n(G v) c(G v) + 1, by induction hypothesis,
= (n(G) 1) c(G v) + 1
= n(G) c(G).
Corollary. For any connected graph G, m(G) n(G)1.
42
difficult open problem to find sufficient conditions (or necessary conditions) for the
existence of a cycle Ck of specified length k. The following theorem gives a sufficient
condition for a simple graph to contain a C3 .
Theorem 2.9. Every simple graph with m >
n2
4
triangle).
n2
.
4
This we do by induction n.
Case 1: n is even.
If n = 2, then the inequality is obvious. So, we proceed to the induction step
assuming that G has n + 2 vertices and that the theorem holds for all graphs on n
vertices. There exists an edge (u, v) in G; else, m = 0. We partition E(G) into three
parts as follows:
(1) E(G) = E(G {u, v}) {e E(G) : e has one end vertex in {u, v} and other
end vertex in G {u, v}} {(u, v)}.
Since G{u, v} has no triangles, m(G{u, v})
n2
,
4
by induction hypothesis.
n2
4
+n+1=
(n+2)2
.
4
43
Distance
The concept of distance occurs in every branch of mathematics; graph theory
is no exception.
Definitions. Let G be a graph and u, v V (G).
The distance dG (u, v) or d(u, v) between u and v is defined as follows:
Theorem 2.11. Let A = [aij ] be the adjacency matrix of a simple graph G. Then the
(i,j) th entry [Ap ]ij in Ap is the number of walks of length p from vi to vj .
Proof. We prove the theorem by induction on p. If p = 1, then Ap is A and the
result is obvious. Suppose that the result is true for p = r and let p = r + 1. We
44
have,
r+1
[A
n
X
]ij =
[Ar ]ik akj .
k=1
Now
[Ar ]ik akj
[Ar ] ,
ik
=
0
By induction, [Ar ]ik is the number of walks of length r connecting vi and vk . Each of
these walks is extendable to a walk of length r + 1 connecting vi and vj iff vk and vj
are adjacent, that is, iff akj = 1. So, by the above equations, [Ar+1 ]ij is the number
of walks of length r + 1 connecting vi and vj .
Theorem 2.12. If G is a connected simple graph, then the distance between vi and
vj is the smallest integer p( 0) such that [Ap ]ij 6= 0.
Proof. By the minimality of p, [Ar ]ij = 0, for every r, 0 r p 1. So, by Theorem
2.11, there is no walk of length p 1 connecting vi and vj ; hence, d(vi , vj ) p.
Since [Ap ]ij 6= 0, there does exist a walk, say W (vi , vj ), from vi to vj . Since, [Ar ]ij =
0, for all r, 0 r p 1, W (vi , vj ) is a walk of minimum length and hence it is a
path. So, d(vi , vj ) p. Combining the two inequalities we get d(vi , vj ) = p.
links. At the outset, observe that the number of components in G v may increase
or decrease or remain the same, when compared to the number of components in G.
In fact, c(G v) < c(G) iff deg(v) = 0.
Let G be a graph, v be a vertex and e be an edge.
Definition. v is said to be a cut-vertex if c(G v) > c(G).
45
(a) G1
(b) G2
(c) G3
Figure 2.7: G1 contains exactly one cut-vertex, G2 contains three cut-vertices and G3
contains no cut-vertices.
Definition. e is said to be a cut-edge of G if c(G e) > c(G).
Remarks.
If e(u, v) is a cut-edge of G, then u and v are in two different components of
G e. Moreover, c(G e) = c(G) + 1.
The two remarks made above with respect to a cut-vertex hold good for a
cut-edge also.
(a) G1
(b) G2
(c) G3
(d) G4
Figure 2.8: Every edge in G1 is a cut-edge, G2 contains exactly one cut-edge and two
cut-vertices, G3 contains a cut-vertex but contains no cut-edge, G4 contains neither
a cut-vertex nor a cut edge.
Theorem 2.13. A vertex v of a connected graph is a cut-vertex if and only if there
exist vertices x and y (6= v) such that every (x, y)-path contains v.
46
47
v
C
P1
P2
x
Figure 2.9: Existence of two paths P1 and P2 in G.
But then Q = (P1 (v, x), P2 (x, y)) is a path of length greater than the length
of P , a contradiction to the maximality of P .
Blocks
Definition.
vertex of its own is called a block of G; maximal in the sense that if H is a connected
subgraph of G that has no cut-vertex and H B, then H = B; see Figure 2.10.
If G has no cut-vertices, then G is called a block.
Remarks.
48
5
4
9
1
10
(a) G
5
4
10
(b) Blocks of G.
A block of a graph does not have a cut-vertex of its own. However, it may
contain cut-vertices of the whole graph. In example 2.10a, the edge joining 4
and 6 is a block and both the end points are cut-vertices of the whole graph.
By definition, G itself is a block if it is connected and it has no cut-vertex.
Two blocks in a graph share at most one vertex; else, the two blocks together
form a block, thus contradicting the maximality of blocks.
If two distinct blocks of G share a vertex v, then v is a cut-vertex of G.
Any two distinct blocks are edge disjoint; so the edge sets of blocks partition
the edge set of G.
To establish a property P of a graph G, often it is enough to establish P for
each of its blocks, and thereby simplify the proofs.
Definition. Two paths P (x, y) and Q(x, y) are said to be internally disjoint if
they have no internal vertex common.
The following result is a special case of a theorem proved by Menger (1932).
Theorem 2.17. Let G be a graph with n(G) 3. Then G is a block if and only
if given any two vertices x and y of G, there exist at least two internally disjoint
(x, y)-paths in G.
Proof. (1) Given any two vertices x, y of G, there exist at least two internally disjoint
(x, y)-paths G is a block.
49
S
Q
z
x
50
G w. Let z be the last vertex in S(x, y) that lies in V (Q) V (R). For definiteness,
let z V (Q). Then (Q(x, z), S(z, y)) and (R(x, w), w, y) are two internally disjoint
(x, y)-paths.
A reformulation of the above theorem yields an alternative characterization of
a block.
Corollary. A graph G with at least three vertices is a block if and only if given any
two vertices x and y, there exists a cycle containing x and y.
2.3
Connectivity
Consider the graphs shown in Figure 2.12 representing communication or
(a) G1
(b) G2
(c) G3
(d) G4
(e) G5
2.3. Connectivity
51
Definitions (k-edge-connectivity).
An edge subset F E(G) is called an edge-cut if G F is disconnected or
G F is a single vertex graph.
The integer
k1 (G) = min{|F | : F E(G) and F is an edge cut}
is called the edge-connectivity of G. That is, k1 (G) is the minimum number
of edges whose deletion disconnects G or results in a single vertex graph.
Any edge-cut F E(G) such that |F | = k1 (G) is called a minimum edge-cut.
A graph G is said to be s-edge-connected if k1 (G) s.
Remarks.
52
k0
k1
G1
0
0
G2
1
1
G3
1
2
G4
2
3
G5
4
4
Kn
n1
n1
Pn
1
1
Cn
2
2
P
3
3
53
2.3. Connectivity
{u1 , . . . , u1 , u } is a vertex-cut of G. Therefore, k0 (G) = k1 (G).
Case 2: G is any graph.
(a) G1
(b) G2
n+k2
, for every vertex v, then G is
2
54
Proof. Let W V (G) be a k-vertex-cut. Then G W contains at least two components and so it has a component D such that d := |V (D)|
nk
.
2
Let x be a vertex
GW
W
Figure 2.14: Estimate for degG (x).
nk
2
1+k =
n+k2
,
2
hypothesis.
If G is simple and diam(G) = 1, then G = Kn and so k1 (G) = n 1 = (G).
The next results shows that simple graphs with diameter 2 also attain maximum
possible edge-connectivity.
Theorem 2.22 (J. Plesink, 1975). If G is simple and diam(G) = 2, then k1 (G) =
(G).
Proof. (Technique of two-way counting) Let F be a a minimum edge-cut; so
|F | = k1 (G). Then G contains exactly two components, say [A] and [B] such that
[A, B] = F . Let |A| = a and |B| = b.
If there exists some pair of vertices x A and y B such that [x, B] = and
[A, y] = , then dist(x, y) 3, contrary to the hypothesis. So, [x, B] 6= , for every
x A or [A, y] 6= , for every y B. For definiteness, let [x, B] 6= , for every x A.
55
2.3. Connectivity
y
x
edge-cut
F
Therefore,
k1 = |F | =
|[x, B]|
xA
1 = a.
(2.1)
xA
k1 = |F | =
|[x, B]|
xA
xA
(2.2)
56
2.4
capacities. In discrete mathematics all these parameters are called the weights
of the links.
Weighted graphs
Definitions.
A pair (G, W), where G is a graph and W : E(G) R is any function is called
a weighted graph; W(e) is called the weight of e. We assume that W(e) 0,
for every edge e.
Convention: Any unweighted graph G is treated as a weighted graph with W(e)
= 1, for every edge e.
P
If H is a subgraph of G, then its weight W(H) is defined to be eE(H) W(e).
P
So, the weight of a path P in G is eE(P ) W(e). It is called the weighted length
of P .
The weighted distance dist(u, v) between two given vertices u and v in a
weighted graph (G, W) is defined as
,
if u and v are not connected.
We often drop the adjective weighted to reduce the writing.
In the graph of Figure 2.16:
The
The
The
The
weight
weight
weight
weight
of
of
of
of
G is 14.5.
the path (u, a, v, c, x, e, y) is 12.
the path (u, a, v, d, x, e, y) is 4.5.
the path (u, b, x, e, y) is 5.
57
u
(a, 1)
(c, 8)
v
(d, 0.5)
(b, 2)
x (e, 3) y
Figure 2.16: A weighted graph (G, W), where the weight of an edge is shown next to
its label.
Proof. Exercise.
In many real world network problems, one is often required to find the shortest
distance and a shortest path between two given nodes. In graph theoretic terminology,
these two problems can be modeled as follows:
Design an algorithm to find the shortest distance and a shortest path between two
given vertices in a given weighted graph.
58
algorithm outputs the distance between u0 and every other vertex. However, it can be
easily modified into an all-to-all algorithm or to a many-to-many algorithm. It is
based on the principle that if (u0 , e1 , u1 , e2 , u2 , . . . , uk1 , ek , uk ) is a shortest (u0 , uk )path, then (u0 , e1 , u1 , e2 , u2 , . . . , uk1 ) is a shortest (u0 , uk1 )-path.
Description of the algorithm
Input: A weighted graph (G, W) and a vertex u0 V (G).
If a pair of vertices u and v are non-adjacent it is assumed that they are joined
by an edge of large weight, say 2W(G) , denoted .
Output: The weighted distance d(u0 , x), for every x V (G).
Remark.
It is a labeling process where every vertex x is dynamically labeled l(x) and at
the termination of the algorithm, l(x) indicates d(u0 , x).
Each vertex x is associated with an array of 3 fields x
l(x)
p(x) , where
59
(If there is more than one vertex for which the minimum is attained, you can
designate any such vertex as ui+1 .)
Step 3: Recursion
S S {ui+1 }; i i + 1; goto step 2.
Step 4: Output l(x) as d(u0 , x), and the array P (x, u0 ) = (x, p(x), p2 (x), . . . , u0 ), for
each x V (G) and STOP.
In the following, we illustrate the algorithm by taking a weighted graph.
b
1
Initialization:
V ertexx
l(x)
a
0
5
6
u0 = a
c
2
u0 = a, p(a) = a, S = {a}; V S =
{b, c, d, e}.
a
0
b
1
c
6
d
8
5
6
min{l(x) : x V S} = 1;
l(b) = 1; p(b) = a, S = {a, b};
V S = {c, d, e}, P = (b, p(b)) = (b, a).
8
d
e
4
60
Iteration 2:
b
x
l(x)
b
1
c
6
d
8
5
6
min{l(x) : x V S} = 3;
2
e
4
b
x
l(x)
b
1
c
6
d
7
5
6
min{l(x) : x V S} = 6;
2
e
4
b
x
l(x)
b
1
c
6
d
7
5
6
min{l(x) : x V S} = 7;
l(d) = 7; p(d) = e; S = {a, b, e, c, d};
V S = , P = (d, e, b, a).
e
4
We stop the algorithm and declare the labels l(x) shown in the above table as
d(a, x).
The shortest (a, b)-path is (a, b).
A shortest (a, c)-path is (a, c). The reader may notice that (a, b, c) is also a
shortest (a, c)-path.
The shortest (a, d)-path is (a, b, e, d).
The shortest (a, e)-path is (a, b, e).
61
the algorithm outputs the shortest distance d(x, y), for every pair (x, y) of vertices.
The algorithm makes use of a recursion formula proved below.
Theorem 2.24 ((Floyd and Warshall, 1962)). Let (G, W) be a weighted graph on
vertices labeled 1, 2, . . . , n. Define
The weighted length of a shortest (i, j)-path with all its internal vertices
k
dij =
from {1, . . . , k}; this path need not contain every vertex from {1, . . . , k}.
Then,
k1
k1
dkij = min{dk1
ij , dik + dkj }.
Proof. Let P be a shortest (i, j)-path with all its internal vertices from {1, . . . , k};
so its length l(P ) = dkij . Two cases arise.
Case 1: k is not an internal vertex of P .
So P is a (i, j)-path with all its internal vertices from {1, 2, ..., k 1}. Hence,
by defintion dkij = l(P ) = dk1
ij .
k
P1
i
P2
j
62
shortest (k, j) path with all its internal vertices from {1, 2, . . . , k 1}. So, l(P1 ) =
k1
dk1
ik , l(P2 ) = dkj . Hence,
k1
dkij = l(P ) = l(P1 ) + l(P2 ) = dk1
ik + dkj .
k1
The two cases imply that l(P ) is either dk1
or dk1
+ dkj
, whichever is minimum.
ij
ik
k1
So, dkij = min {dk1
+ dk1
ij , dik
kj }.
0,
Wij =
W(i, j),
if i = j,
if i 6= j and i, j are adjacent,
if i 6= j and i, j are non-adjacent.
The output is the n n matrix [dnij ], whose (i, j)th entry is the length of a
shortest (i, j)-path.
Description of Floyd-Warshall algorithm
Input: A weighted graph (G, W) on vertices 1, 2,. . . , n.
Step 1: Initial: D0 W (G)
Step 2: Recursion:
for k = 1 to n do
63
An advantage of the algorithm is that it requires very little knowledge of program coding.
The algorithm can be modified to output a shortest (x, y)-path; see exercises.
We again take the graph shown in Fig. 2.17 and illustrate the algorithm with
vertices labeled a = 1, b = 2, c = 3, d = 4 and e = 5. In the following, we show the
sequence of matrices D0 , D1 , D2 , D3 , D4 , D5 successively generated by the algorithm.
b
1
5
6
u0 = a
c
2
e
4
d
Figure 2.19: The input graph G.
64
Output matrix D =
a=1
b=2
c=3
d=4
e=5
[d1ij ]
indicates the length of a shortest (i, j)-path with internal vertices from {1 = a}.
a
a=1
b=2
c=3
d=4
e=5
Output matrix after 2nd (i, j) loop, where d2ij = min {d1ij , d1i2 + d12j } indicates
the length of a shortest (i, j)-path with internal vertices from {1 = a, 2 = b}.
a
a=1
b=2
c=3
d=4
e=5
Output matrix after the 3rd (i, j) loop, D3 = [d3ij ], where d3ij = min{d2ij , d2i3 + d23j }
indicates the length of a shortest (i, j)-path with internal vertices from {1 = a, 2 =
b, 3 = c}.
65
a=1
b=2
c=3
d=4
e=5
th
[d4ij ],
indicates the length of a shortest (i, j)-path with internal vertices from {1 = a, 2 =
b, 3 = c, 4 = d}.
a
a=1
b=2
c=3
d=4
e=5
Output matrix after the 5th (i, j) loop, D5 = [d5ij ], where d5ij = min{d4ij , d4i4 + d44j }
indicates the length of a shortest (i, j)-path with internal vertices from {1 = a, 2 =
b, 3 = c, 4 = d, 5 = e} = The length of a shortest (i, j)-path.
a
a=1
b=2
c=3
d=4
e=5
66
Exercises
1. Draw 3 mutually non-isomorphic graphs on 6 vertices and 5 edges, which do
not contain cycles.
2. Give an example of a 3-regular graph on 10 vertices in which the minimum
length of a cycle is 5.
3. Show that any two longest paths in a connected graph have a vertex in common.
Does this assertion hold for a disconnected graph?
4. If C is a cycle in G, then an edge of G which joins two non-consecutive vertices
of C is a called a chord of C. For example, (2, 5) is a chord of the 5-cycle
(1, 2, 3, 4, 5, 1). Show that if G has an odd cycle then it has an odd cycle
without chords.
5. Let G be a triangle-free graph and let C be a cycle of minimum length in G.
Show that every vertex in V (G) V (C) is adjacent with at most two vertices
of C.
6. If G is simple, connected, incomplete and n 3, then show that G has three
vertices u, v, w such that (u, v), (v, w) E(G) but (u, w)
6 E(G).
7. Give an example of a graph G such that
(a) every two adjacent vertices lie on a common cycle,
(b) there exists two adjacent edges that do not lie on a common cycle.
8. Let G be a graph. Define a relation R on V (G) as follows. If u, v V (G),
then u R v iff there exists a path connecting u and v. Show that R is an
equivalence relation on G. What are the induced subgraphs [V1 ], [V2 ], . . . , [Vp ],
where V1 , V2 , . . . , Vp are the equivalence classes?
, then show that G is connected. Give an example
9. If G is simple and (G) n1
2
of a disconnected simple graph G on 8 vertices with (G) = 3.
10. If m > n1
and G is simple, then show that G is connected. For each n 1,
2
find a disconnected graph with m = n1
.
2
11. If deg(u) + deg(v) p 1, for every pair of non-adjacent vertices in a simple
graph G , then show that (i) G is connected, (ii) diam(G) 2 and (iii) G has
no cut-vertices.
12. Let G be a simple graph on vertices v1 , v2 , . . . , vn . Show that
67
nk
2
edges.
68
24. If G is a 2-connected graph, then show that for some (x, y) E(G), G x y
is connected.
25. If the average degree of a connected graph G is greater than two, prove that G
has at least two cycles.
26. Draw connected spanning subgraphs H1 , H2 and H3 of the graph G (shown
below) having diameters 2,3 and 4 respectively and with minimum number of
edges.
1
5
3
G
27. Give an example of a graph with the following properties or explain why no
such example exists.
(i) A 4-connected graph that is not 3-connected.
(ii) A 3-connected graph that is not 4-connected.
(iii) A 2-edge-connected graph that is not 3-edge-connected.
(iv) A 3-edge-connected graph that is not 2-edge-connected.
28. (a) If G is disconnected, then show that Gc is connected. Is the converse true?
(b) If G is simple, show that G or Gc has diameter 3.
(c) If G is self-complimentary, show that 2 diam(G) 3.
29. For any two graphs G1 and G2 , show the following.
(a) k0 (G1 G2 ) = 0.
(b) k0 (G1 + G2 ) = min{k0 (G1 ) + n(G2 ), k0 (G2 ) + n(G1 )}.
(c) k1 (G1 G2 ) = 0.
(d) k1 (G1 + G2 ) = (G1 + G2 ).
30. Give an example of a graph G with the following properties or state why such
examples do not exist.
(a) k0 (G) = 3, k1 (G) = 4 and (G) = 5
69
n+1
,
2
38. If G is simple and has no even cycles, then show that each block of G is either
K2 or an odd cycle.
39. Draw a network N with 7 nodes and with minimum number of links satisfying
the following conditions. Justify that your network has minimum number of
links.
(i) N contains no self-loops and multiple links.
(ii) If any two nodes fail, the remaining 5 healthy nodes can communicate
along themselves.
70
d
2
1
a
10
5
c
44. Find the entry in the first row and second column of the matrix generated after
applying one iteration of the Floyd-Warshall algorithm to the weighted graph
shown below.
d 4 c
6
2
a 1 b