Scribd
Upload
91 views2 pages

Graph Theory Leasson 2

The document discusses Hamiltonian paths and circuits in graphs. A Hamiltonian path visits each vertex once without revisiting vertices, while a Hamiltonian circuit visits each vertex once and returns to the starting point without revisiting other vertices. It provides an example graph that has both a Hamiltonian path and circuit. Dirac's theorem is presented for determining when a graph is guaranteed to have a Hamiltonian circuit based on vertex degrees. Two example graphs are given to explore whether they contain Hamiltonian paths/circuits. The document then introduces weighted graphs and provides a weighted example graph to find the shortest paths between vertices.

Uploaded by

matain elementary School
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
91 views2 pages

Graph Theory Leasson 2

The document discusses Hamiltonian paths and circuits in graphs. A Hamiltonian path visits each vertex once without revisiting vertices, while a Hamiltonian circuit visits each vertex once and returns to the starting point without revisiting other vertices. It provides an example graph that has both a Hamiltonian path and circuit. Dirac's theorem is presented for determining when a graph is guaranteed to have a Hamiltonian circuit based on vertex degrees. Two example graphs are given to explore whether they contain Hamiltonian paths/circuits. The document then introduces weighted graphs and provides a weighted example graph to find the shortest paths between vertices.

Uploaded by

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

Name: ___________________________________________ Course and Set: _________________

Graph Theory

Hamiltonian Circuit and Path – this focused on crossing all the vertices in a graph without passing through the same
vertex twice or more.

For Example:

Hamiltonian Path Hamiltonian Circuit

Hamiltonian Path – is a path that all vertices can be Hamiltonian Circuit – is a path that all vertices can
visited without passing through be visited without passing through
the same vertex twice or more. the same vertex twice or more but
cannot go back to the same starting
point.

In the given example, Hamiltonian path and Hamiltonian circuit can co-exist.
Unfortunately, unlike to Eulerian Path and Circuit, there is NO PERFECT theorem to easily recognize a graph if the
Hamiltonian Path or Circuit exists in the given graph.

Let’s Try! Find if Hamiltonian Path and Circuit co-exists in the given graphs A and B.

Graph A Graph B

Dirac’s Theorem – a graph with n is ≥ 3 vertices, and every vertex is having a degree of ≥ n/2 is Hamiltonian.
Example:

There are vertices in this graph, each vertex has a degree


of greater than equal to 6/2 or 3. So, it is a Hamiltonian.
Let’s study this graph. We know that in this graph, Hamiltonian Path and
Circuit exists.

But, the conditions in Dirac’s Theorem are not met. Why?


What does this imply?

Weighted Graph – graph in which edges are associated with a value.

MATAIN CALAPACUAN SANTO TOMAS NAUGSOL CALAPANDAYAN MANGGAHAN


MATAIN 50 110 None None 100
CALAPACUAN 50 140 80 50 120
SANTO TOMAS 110 140 None 90 80
NAUGSOL None 80 None None 75
CALAPANDAYAN None 50 90 None 85
MANGGAHAN 100 120 80 75 85

Finding shortest path or route.

1. What is the shortest route if your destination is Manggahan and you are from Calapacuan?
2. What is the shortest route if you want to go to Naugsol and you are currently at Matain?

You might also like