0% found this document useful (0 votes)
44 views28 pages

DM 17 Connectivity

This document provides an outline for a lecture on connectivity in discrete mathematics. It discusses key concepts like paths, circuits, connectedness in undirected and directed graphs, and graph isomorphism. The objectives are to understand these terms and be able to determine if graphs are connected, weakly/strongly connected, or isomorphic. Examples are provided to illustrate paths, connectedness, and determining isomorphism between two graphs by examining properties like simple circuits of certain lengths.

Uploaded by

Wasifa Mrittika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
44 views28 pages

DM 17 Connectivity

This document provides an outline for a lecture on connectivity in discrete mathematics. It discusses key concepts like paths, circuits, connectedness in undirected and directed graphs, and graph isomorphism. The objectives are to understand these terms and be able to determine if graphs are connected, weakly/strongly connected, or isomorphic. Examples are provided to illustrate paths, connectedness, and determining isomorphism between two graphs by examining properties like simple circuits of certain lengths.

Uploaded by

Wasifa Mrittika
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 28

Connectivity

Course Code: 00090 Course Title: Discrete Mathematics

Dept. of Computer Science


Faculty of Science and Technology

Lecturer No: 17 Week No: 10 Semester:


Lecturer: Name & email
Lecture Outline

Connectivity 8.4
• Paths
• Circuits
• Simple path and Simple circuits
• Connectedness in undirected Graph
• Connectedness in directed Graph
• Graph Isomorphism : checking simple circuit of certain
length
Objectives and Outcomes
• Objectives: To understand the terms path, circuit, simple path,
simple circuit; to understand connectedness in undirected and
directed graphs, to determine whether two graphs are isomorphic.

• Outcomes: The students are expected to be able to explain path,


circuit, simple path, simple circuit; be able to determine whether
an undirected graph is connected or whether a directed graph is
weakly or strongly connected; be able to determine whether two
graphs are isomorphic.
Paths

• A path is a sequence of edges that begins at a


vertex of a graph and travels from vertex to
vertex along edges of the graph.
Paths

• Definition1: Let n be a nonnegative integer and G an


undirected graph. A path of length n from u to v in G is a
sequence of n edges e1, e2 , …., en of G such that
e1 is associated with {x0, x1}, e2 is associated with {x1, x2 }, and
so on, with en associated with {xn-1, xn }, where x0=u and xn=v.
• The path is a circuit if it begins and ends at the same vertex,
that is, if u = v, and has length greater than zero.
• The path or circuit is said to pass through the vertices x1, x2, …,
xn-1 or traverses the edges e1, e2 , …., en .
• A path/circuit is simple if it does not contain the same edge
more than once.
Paths in Directed Graph

• Same as in undirected graphs, but the path must go


in the direction of the arrows.
Connectedness in Undirected Graphs

• An undirected graph is called connected if there is a


path between every pair of distinct vertices of the
graph
Example 2 (p.561)

 In the simple graph shown in Figure, a , d, c, f, e is a simple path


of length 4, because {a , d}, {d, c } , {c, f}, and { f, e} are all edges.
 However, d, e, c, a is not a path, because {e, c} is not an edge.
 Note that b, c, f, e, b is a circuit of length 4 because {b, c}, {c, f},
{f, e}, and {e, b} are edges, and this path begins and ends at b.
 The path a, b, e, d, a, b, which is of length 5, is not simple
because it contains the edge {a, b} twice.
Example 6 (p.563)

Figure 3: The Graphs G 1 and G2

 The graph G l in Figure 3 is connected, because for every pair


of distinct vertices there is a path between them.
 However, the graph G 2 in Figure 3 is not connected. For
instance, there is no path in G2 between vertices a and d.
Connectivity

• Connectivity is a basic concept of graph theory. It defines whether a graph


is connected or disconnected. Without connectivity, it is not possible to
traverse a graph from one vertex to another vertex.
• A graph is said to be connected graph if there is a path between every pair
of vertex. From every vertex to any other vertex there must be some path
to traverse. This is called the connectivity of a graph.
• A graph is said to be disconnected, if there exists multiple disconnected
vertices and edges.
• Graph connectivity theories are essential in network applications, routing
transportation networks, network tolerance etc.
Connectivity
• Question: Which of the following graphs are connected?

1 2

3
4
Connectivity

Answer: First and second are disconnected. Last one is connected.

1 2

3
4
Connected Components

• A connected component of a graph G is a connected


subgraph of G that is not proper subgraph of another
connected subgraph of G.
• A connected component of a graph G is a maximal
connected subgraph of G.
– A graph G that is not connected has two or more
connected components that are disjoint and have
G as their union
Connected Components

• Definition: A connected component in a graph G is a set of


vertices such that all vertices in the set are connected to each
other and every possible connected vertex is included.
• Question : What are the connected components of the
following graph?
1
6 2

7
8
5 3
4
Connected Components

• Answer: The connected components are {1,3,5},


{2,4,6}, {7} and {8} as one can see visually by
pulling components apart:

1
6 2

8 7
5 3
4
Connectedness in Directed
Graphs

• A directed graph is strongly connected if there is a path from a


to b and from b to a whenever a and b are vertices in the graph.
– For a directed graph to be strongly connected there must be
a sequence of directed edges from any vertex in the graph to
any other vertex
• A directed graph is weakly connected if there is a path between
every two vertices in the underlying undirected graph.
 Note: Any strongly connected directed graph is also weakly
connected, but the opposite is not true.
EXAMPLE: Are the directed graphs G and H shown in Figure
strongly connected? Are they weakly connected?

Weakly Strongly
H is strongly connected because
Connected Connected there is a path between any two
vertices in this directed graph.
Hence, H is also weakly connected.

The graph G is not strongly


connected. There is no directed
path from a vertex to other vertex
in this graph.

G H
Example

• Graph G is strongly connected (hence G is also weakly


connected). Graph H is not strongly connected, however H is
weakly connected.

a b a b

c
c

e d e d

Graph G Graph H
Paths and Isomorphism

• There are several ways that paths & circuits can help
determine whether two graphs are isomorphic.
– For example, the existence of a simple circuit of a
particular length is a useful invariant that can be used to
show that two graphs are not isomorphic
• A useful isomorphic invariant for simple graphs is
the existence of a simple circuit of length k, where k
is a positive integer greater than 2.
Graph Isomorphism – Example
Determine whether the graphs G and H are isomorphic.

v2 u2
v1 v3 u1 u3

v5 v4 u5 u4

G H
Solution

At first, you check all the graph invariants between


the two graphs you know so far. If there is any mismatch, then
the graphs are not isomorphic.
However, if all the graph invariants are same, then you go for
mapping (i.e., mapping the vertices of one graph to another).
Here, all the graph invariants are same (you check it!).
Now you go for mapping…
f (v1) = u1 , f (v2) = u3 , f (v3) = u5 , f (v4) = u2 , f (v5) = u4
The function f is bijective (i.e., one-to-one as well as onto).
So, the graphs G and H are isomorphic.
Example 14(p.565): Determine whether the graphs
G and H shown in Figure 8 are isomorphic.

Figure 8
Solution

 Both G and H have six vertices and eight edges.


 Each has four vertices of degree three, and two vertices of
degree two.
 So, the three invariants –number of vertices, number of
edges, and degrees of vertices —all agree for the two
graphs. [Note: you must check other graph invariants too]
 However, H has a simple circuit of length three, namely, v1,
v2, v6, v1 , whereas G has no simple circuit of length three,
as can be determined by inspection (all simple circuits in
G have length at least four).
 Because the existence of a simple circuit of length three is
an isomorphic invariant, G and H are not isomorphic.
Example 15 (p.566) : Determine whether the graphs
G and H shown in Figure 9 are isomorphic.

Figure 9
Solution

 Both G and H have five vertices and six edges.


 Each has two vertices of degree three, and three vertices
of degree two.
 Both have a simple circuit of length three, a simple circuit
of length four, and a simple circuit of length five.
 Because all these isomorphic invariants agree here, so
G and H may be isomorphic.
 …..continued to next slide
Finding of possible isomorphism:
 ………. we will follow paths that go through all vertices so that the
corresponding vertices in the two graphs have the same degree.

 For example, the paths u1, u4,u3, u2, u5 in G and v3, v2, v1, v5, v4 in H both go
through every vertex in the graph; start at a vertex of degree three; go
through vertices of degrees two, three, and two, respectively; and end at a
vertex of degree two.
 By following these paths through the graphs, we can define the mapping f
with
 f (u1) = v3
 f (u2) = v5
 f (u3) = v1
 f (u4) = v2
 f (u5) = v4
 It shows that f is an isomorphism, so G and H are isomorphic.
Books

• Rosen, K. H., & Krithivasan, K. (2012). Discrete mathematics and its


applications: with combinatorics and graph theory. Tata McGraw-Hill
Education. (7th Edition)
• Liu, C. L. (1986). Elements of discrete mathematics. Tata McGraw-Hill Education.
References

1. Discrete Mathematics, Richard Johnsonbaugh, Pearson education, Inc.


2. Discrete Mathematical Structures, Bernard Kolman, Robert C. Busby, Sharon Ross,
Prentice-Hall, Inc.
3. SCHAUM’S outlines Discrete Mathematics(2nd edition), by Seymour Lipschutz, Marc
Lipson

• Open University Catalonia https://www.csd.uoc.gr/~hy583/papers/ch17.pdf


• Duke University https://www2.cs.duke.edu/courses/spring11/cps102/notes/lec23.pdf

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy