Scribd
Upload
29 views7 pages

Graph Theory Handout 1

The document provides an overview of graph theory, defining key concepts such as graphs, vertices, edges, and their properties including degrees, types of graphs (simple, multigraph, directed, undirected, mixed, complete), paths, cycles, subgraphs, and complement graphs. It also discusses regular graphs, connected and disconnected graphs, and introduces exercises related to these concepts. The document serves as a foundational guide to understanding the structure and classification of graphs.

Uploaded by

Tahmid Hameem Chowdhury
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
29 views7 pages

Graph Theory Handout 1

The document provides an overview of graph theory, defining key concepts such as graphs, vertices, edges, and their properties including degrees, types of graphs (simple, multigraph, directed, undirected, mixed, complete), paths, cycles, subgraphs, and complement graphs. It also discusses regular graphs, connected and disconnected graphs, and introduces exercises related to these concepts. The document serves as a foundational guide to understanding the structure and classification of graphs.

Uploaded by

Tahmid Hameem Chowdhury
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/ 7

Graph Theory

Tahmid Hameem Chowdhury

Let’s first define what is a Graph:

Now the amount of time a vertex is connected to an edge is an important property of that vertex called
degree.

Unlike geometry in Graph Theory we usually don’t care whether the points are connected by a straight
line or not, we only care about the connections. Therefore, if two graphs have same type of connections
with same type of vertices, then they are considered Equivalent Graphs.
Now, a pair of vertices might be joined with more than one edge, in that case the graph would be called
a Multigraph. The multi-edge connection can be one of the following two types:

Therefore, if a graph contains either a loop or a multiple edge then it is a Multigraph. And otherwise it is
called a Simple Graph.

If an edge has a direction associated with it then it is called a directed edge. Based on this graphs can be
divided into 3 categories:

 Undirected Graph: A graph with no directed edge.


 Directed Graph: A graph with all edges directed.
 Mixed Graph: A graph with a mixture of directed and undirected edge.

If all the pair of vertices are joined with an edge then, it is called a Complete Graph. A complete graph
with n – vertices is represented by Kn, here is a list of complete graphs for some values of n,

Paths in Graph: A path is an ordered sequence of vertices (v1, v2, … , vk), such that, all the pairs vi and
vi+1 are connected with an edge for all

For example:

Here (A, B, C, E) is a set of vertices that form a path.

Cycle: A path that has the same ending and starting vertex is a cycle. For example, in the above picture,
(A, B, C, E, A) is a path that starts at A and also ends at A. So this is a cycle.
Length of Path and Cycle: The length of a path or a cycle is the number of edges in that path or cycle.
Now since graph is composed of two sets, so similar to subsets we have subgraph. A subgraph H of a
graph G is another graph formed from a subset of the vertices and edges of G if all endpoint of the edges
of H are in the vertex set of H. For example, if the following graph is G,

Then the following are some subgraphs of G:

And similar to complement set we have complement graph. A Complement Graph of a graph G is
denoted by G’, which has the same set of vertices, but if an edge is in G then it is not in G’ and if it is not
in G then it is in G’.

If a vertex has odd degree then it is called an odd vertex, and if it has even degree then it is an even
vertex. If a vertex has no edge adjacent to it then it is an even vertex with degree 0.

Now, if all the vertices of G have equal degree then it is called a Regular Graph, and if the degree is k
then it is called a k – regular graph.

Based on path we can define two different types of graphs:

 Connected Graph: If for all pairs of vertices (u, v) there is a path that starts at u and ends at v is
called a connected graph.
 Disconnected Graph: If there exists at least one pair of vertices (u, v) such that there is no path
that starts at u and end at v then it is called a disconnected graph.
Now, as we can see even if a graph is disconnected it still contains some parts which are connected to
each other and disjoint from the others. These smaller parts are called connected components.
Exercise

1.

2.

3.

4. Prove that a graph can’t have 2025 odd vertices.

5.

6.

7.

8. (Handshake Lemma) Prove that in every graph there are two vertices with
equal degree.
9.

10. a. Describe all 2 – regular graphs.


b. Describe all connected 2 – regular graph.

11.

12.

13.

14.

15.

16.
17.

18.

You might also like