CS 2150: Graph Theory for Computing

Batch 17 Research Cycle I

Group Report
Group C3

Group Members: Kumara T.G.V.S.H. 170326U

Muthukumarana P.T.R 170393U
Rajendren D. 170478K
Rajinthan T. 170479N
Ranasinghe A.I. 170482R
Definitions

Graph [1]
Graph G =(V,E) , is an ordered pair of finite sets where E is a subset of V2.

Graph Vertex[2]
"Vertex" is a synonym for a node of a graph[1]

Graph Edge[3]

For an undirected graph, an unordered pair of nodes that specify a line joining these two nodes
are said to form an edge. For a directed graph, the edge is an ordered pair of nodes[2]

Vertex Degree[4]

The degree of a graph vertex v of a graph G is the number of graph edges which touch v. The
vertex degrees are illustrated above for a random graph. The vertex degree is also called the local
degree or valency.

Walk[5]

A walk is a sequence v_0, e_1, v_1, ..., v_k of graph vertices v_i and graph edges e_i such that
for 1<=i<=k, the edge e_i has endpoints v_(i-1) and v_i
Trail[6]
A trail is a walk with no repeated edges.

Path[7]
A graph path is a sequence {x_1,x_2,...,x_n} such that (x_1,x_2), (x_2,x_3), ..., (x_(n-1),x_n)
are graph edges of the graph and the x_i are distinct.

Circuit[8]
A closed trail is called a circuit when it is specified in cyclic order but no first vertex is explicitly
identified.

Cycle[9]

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the
edge set of G that forms a path such that the first node of the path corresponds to the last.

Hamiltonian Cycle[10]

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a
graph cycle (i.e., closed loop) through a graph that visits each node exactly once (Skiena 1990, p.
196). A graph possessing a Hamiltonian cycle is said to be a Hamiltonian graph.

Hamiltonian Graph[11]

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A
graph that is not Hamiltonian is said to be nonhamiltonian.

Theorem and Proof

Ore's Theorem
If a graph G has n graph vertices such that every pair of the n graph vertices which are not joined
by a graph edge has a sum of valences which is >=n, then G is Hamiltonian. A graph satisfying
Ore's criterion is known as an Ore graph.

Proof of Ore’s Theorem

Assigned problem

Two CSE grads Mohan and Vathish, both working at Virtusa, have rented a flat together.
They have a dinner party where 10 other people from Virtusa are invited. In the group of 12
people, each of them knows at least 6 other people. Prove that they can seat at a round table in
such a way that everyone knows the two people sitting next to them.

Solution

Other Questions
TODO : 1 Question
https://www.whitman.edu/mathematics/cgt_online/book/section05.03.html

References