Scribd
Upload
143 views

Graph Theory Notes PDF

This document defines key terms related to graph theory such as loops, multiple edges, paths, circuits, adjacency, degrees, and different types of graphs like complete graphs. It provides examples of graphs with loops and multiple edges. It explains that a complete graph Kn has n vertices and the number of edges is equal to 1/2*n(n-1). It also discusses Euler paths and circuits, Hamiltonian paths and circuits, and when a graph is guaranteed to have a Hamiltonian circuit based on the minimum degree of its vertices.

Uploaded by

Athena Ledesma
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
143 views

Graph Theory Notes PDF

This document defines key terms related to graph theory such as loops, multiple edges, paths, circuits, adjacency, degrees, and different types of graphs like complete graphs. It provides examples of graphs with loops and multiple edges. It explains that a complete graph Kn has n vertices and the number of edges is equal to 1/2*n(n-1). It also discusses Euler paths and circuits, Hamiltonian paths and circuits, and when a graph is guaranteed to have a Hamiltonian circuit based on the minimum degree of its vertices.

Uploaded by

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

Terms Related To Graph Theory: Example:

 A loop is an edge connecting a vertex itself. How many edges does a graph with 10 vertices have?
 If two vertices are connected by more than one What is the degree of each vertex?
edge, these edge are called multiple edges.
 A graph with no loops and no multiple edges is Solution:
called a simple graph. 1
Kn, e = 2 n (n-1)
 A path is an alternating sequence of vertices and 1
edges. It can be seen as a trip from one vertex to Kn, e = 2 10 (10-1)
another using the edges of the graph. Kn, e = 45 edges
 A graph is connected if there is a path connecting
all the vertices. Degree = n – 1
 If a path begins and ends with the same vertex, it is = 10 – 1 = 9 (degree of each vertex)
a closed path, or a circuit or cycle.
 Two vertices are adjacent if there is an edge Euler Paths and Circuits
joining them.  An Euler Circuit is a closed path (starts and ends at
 If every pair of vertices of a graph are adjacent, the the same vertex) that uses every edge, but never uses
graph is complete. A complete graph with n the same edge twice. The path may cross through
vertices is denoted by Kn vertices more than once.
 The degree of a vertex is the number of edges  Eulerian Graph Theorem – a connected graph is
attached to it. Eulerian if and only if every vertex of the graph is of
even degree.
Examples of Graphs  An Euler Path is a path that uses every edge in the
 Null or Disconnected Graph graph exactly once but it does not start and end at the
The graph is null or disconnected since same vertex.
it has four vertices but no edges. The  A connected graph contains an Euler Path if and
degree of each vertex is zero. only if the graph has two vertices of odd degrees with
 Graph with a Loop all other vertices of even degrees. Furthermore, every
path must start at one of the vertices of odd degrees
and end at the other.

Hamiltonian Paths and Circuits


 Graph with Multiple Edges  A Hamiltonian Path is a path that visits each vertex
of the graph exactly once.
 A Hamiltonian Circuit is a path that uses each
vertex of a graph exactly once and returns to the
starting vertex.
Both graphs are connected and have a multiple edges  A graph that contains a Hamiltonian circuit is called
connecting vertices A and B. The degrees of vertices A Hamiltonian.
and B in G1 are both 3 while that of G2 are both 4.
In Euler circuits, closed paths use every edge exactly
Complete Graph once, possibly visiting a vertex more than once. On
A complete graph is a connected graph in which every contrary, in Hamiltonian circuits, paths visit each vertex
possible edge is drawn between vertices. It should not exactly once. But unlike the Euler Circuit , where the
contain multiple edges. Eulerian Graph Theorem is used to determine whether it
contains an Euler circuit or not, there is no straightforward
criterion to determine whether or not a Hamilton circuit
exists in a graph.

In some graphs, the following theorem can help identify


if a graph is Hamiltonian:
- Consider a connected graph with at least 3
vertices and no multiple edges. Let n be the
Let e be the number of edges in a complete graph. From number of vertices in the graph. If every vertex
the previous examples of complete graphs, we have 𝑛
has degree of at least 2 , then the graph ‘must be’
identified that …
Hamiltonian.
K1: e = 0, degree of the vertex is 0
K2: e = 1, degree of the vertex is 1
K3: e = 3, degree of the vertex is 2
K4: e = 6, degree of the vertex is 3

𝟏
For Kn, e = 𝟐 n (n-1) and for n ≥ 2, the degree is equal
to n – 1.

You might also like