Scribd
Upload
2 views

Graph5_E11

The document covers fundamental concepts of graphs, including definitions of connected and disconnected graphs, connected components, and theorems related to paths and edges in graphs. It explains that a graph is connected if there is a path between every pair of distinct vertices, and introduces the concept of connected components as maximal connected subgraphs. Additionally, it presents theorems regarding the existence of paths between vertices of odd degree and the maximum number of edges in a simple disconnected graph based on its vertices and components.

Uploaded by

dfanish18
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Graph5_E11

The document covers fundamental concepts of graphs, including definitions of connected and disconnected graphs, connected components, and theorems related to paths and edges in graphs. It explains that a graph is connected if there is a path between every pair of distinct vertices, and introduces the concept of connected components as maximal connected subgraphs. Additionally, it presents theorems regarding the existence of paths between vertices of odd degree and the maximum number of edges in a simple disconnected graph based on its vertices and components.

Uploaded by

dfanish18
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

Discrete Mathematics and Graph Theory

Module III
Fundamentals of Graphs
Graphs: Introduction, Isomorphism, Subgraphs, Walks, Paths, Circuits, Connectedness, Components, Euler
Graphs, Hamiltonian Paths and Circuits.
_____________________________________________________

Connectedness, Components

Definition 1. Connected & Disconnected Graphs


A graph is connected if there is a path between every pair of distinct vertices of the graph.
A graph, which is not connected, is called disconnected.
We say that we disconnect a graph when we remove vertices or edges, or both, to produce
a disconnected subgraph.

Example 1. Consider the following graphs G1 and G2:

Graph G1 is connected, because for every pair of distinct vertices there is a path between them.
Graph G2 is not connected. For instance, there is no path in G2 between vertices a and d.

Definition 2. Connected Components


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.
OR
A disconnected graph is the union of two or more connected subgraphs, each pair of which
has no vertex in common. These disjoint connected subgraphs are called the connected
components of the graph.

Remark. A maximal connected subgraph of G is a connected subgraph of G that is


maximal with respect to the property of connectedness.

Example 2. The graph H is the union of three disjoint connected subgraphs 𝐻1 , 𝐻2 , and 𝐻3 ,
shown below. These three subgraphs are the connected components of H.

Figure. The Graph H and its Connected Components 𝐻1 , 𝐻2 , and 𝐻3 .

Theorem 1. If a graph 𝐺 (either connected or disconnected) has exactly two vertices of odd
degree, then there exists a path joining these two vertices.

Proof.
Case (i) Let 𝐺 be connected.
Let 𝑣1 and 𝑣2 be the only vertices of 𝐺 which are of odd degree. Now, we know that
the number of odd vertices is even. Therefore, there is a path joining these two vertices.

Case (ii) Let 𝐺 be disconnected.


Then the components of 𝐺 are connected. Hence, 𝑣1 and 𝑣2 must belong to the same
component of 𝐺. Therefore, there is a path between 𝑣1 and 𝑣2 .
Theorem 2. The maximum number of edges in a simple disconnected graph 𝐺 with n vertices
1
and k components is (𝑛 − 𝑘)(𝑛 − 𝑘 + 1).
2

Proof.
Let 𝐺 = (𝑉, 𝐸) be a simple graph with 𝑛 vertices and 𝑘 components. Suppose, each of the
components has 𝑛1 , 𝑛2 , … , 𝑛𝑘 . Therefore, we have
𝑛1 + 𝑛2 + … + 𝑛𝑘 = 𝑛

∴ ∑𝑛𝑖=1 𝑛𝑖 = 𝑛 (1)

We know that

∑𝑘𝑖=1(𝑛𝑖 − 1) = 𝑛 − 𝑘 (2)

Squaring both sides of (2),


𝑘 2

[∑(𝑛𝑖 − 1)] = [𝑛 − 𝑘]2


𝑖=1

⇒ ∑𝑘𝑖=1(𝑛𝑖2 − 2𝑛𝑖 ) + 𝑘 + (non-negative cross term) = 𝑛2 + 𝑘 2 − 2𝑛𝑘

⇒ ∑𝑘𝑖=1 𝑛𝑖2 − 2 ∑𝑛𝑖=1 𝑛𝑖 + 𝑘 ≤ 𝑛2 + 𝑘 2 − 2𝑛𝑘

⇒ ∑𝑘𝑖=1 𝑛𝑖2 − 2𝑛 + 𝑘 ≤ 𝑛2 + 𝑘 2 − 2𝑛𝑘 , by (1)

⇒ ∑ 𝑛𝑖2 ≤ 𝑛2 + 𝑘 2 − 2𝑛𝑘 + 2𝑛 − 𝑘
𝑖=1

⇒ ∑ 𝑛𝑖2 ≤ 𝑛2 − 𝑘(2𝑛 − 𝑘) + 1(2𝑛 − 𝑘)


𝑖=1

⇒ ∑𝑘𝑖=1 𝑛𝑖2 ≤ 𝑛2 − (2𝑛 − 𝑘)(𝑘 − 1) (3)

We know that the maximum number of edges in the ith component of a simple graph is
1
= 𝑛𝑖 (𝑛𝑖 − 1).
2

1
Hence, the maximum number of edges in a graph = ∑𝑘𝑖=1 𝑛𝑖 (𝑛𝑖 − 1)
2

𝑘 𝑘
1 1
= ∑ 𝑛𝑖2 − ∑ 𝑛𝑖
2 2
𝑖=1 𝑖=1

1
= [𝑛2 − (2𝑛 − 𝑘)(𝑘 − 1) − 𝑛] , by (1) & (3)
2

Simplifying, we get:

1
Maximum number of edges in a graph = (𝑛 − 𝑘)(𝑛 − 𝑘 + 1).
2

Exercise Questions for Regular Practice (For Students)


1. Let G be a simple graph with 𝑛 vertices and 𝑘 connected components. Then, show that
𝑘

∑ 𝑛𝑖2 ≤ 𝑛2 − (2𝑛 − 𝑘)(𝑘 − 1)


𝑖=1

2. Show that a simple graph with 𝑛 vertices and 𝑘 connected components has at most
1
(𝑛 − 𝑘)(𝑛 − 𝑘 + 1) edges.
2

***

You might also like