Professional Documents
Culture Documents
In a hostel, there are around ‘n’ number of students (assume a number above 100 for n)
with rooms categorized as triple, double, and single occupancy. Explain how you will
Simple graph: A simple graph is an undirected graph with no loops or multiple edges
Multigraph: A graph that has several edges connecting the same set of vertices. It has
I've opted to utilize Students as the vertices rather than Rooms. The selection can be
the hostel. Students are the entities depicted by vertices in the graph.
between any two distinct students, assuming a single student occupies a single
room and doesn't share with multiple others. Each student vertex connects to
vertex to itself, also called a self-loop. A Simple graph cannot contain any loops.”
student is connected to themselves, are typically omitted. This scenario indicates that
a student has their own room, which is unusual in a dormitory setting. Loops are thus
the graph shows links between students and rooms, it is a simple graph that precludes
the appearance of loops. As a result, there are no loops in this graph portraying
iii. What is the possible maximum and minimum degree for each student?
Minimum Degree:
o The minimum degree for a student vertex is typically 0 if the student is not
o However, in a typical hostel scenario where each student occupies at least one
room, the minimum degree for each student would be 1, indicating their
Maximum Degree:
If each student can occupy only one room, the maximum degree for each
student would be 1, as a student can connect to only one room (vertex). The
Graphs serve as potent tools for visually representing problems, yet their setup
So, not all problems are easily converted into graph structures, nor can
considering an example of a situation that has 11 vertices such that the degree of
Not every problem can be effectively represented by a graph. Graphs are useful
for modeling and visualizing relationships among entities, but not all scenarios
Consider the following scenario: a situation with 11 vertices, each with a degree
complete graph with 11 vertices (denoted as K11) has 55 edges since each of the
K 11= (V , E )
o V represents the set of vertices, which contains 11 elements
( V ={ v 1 , v 2 , v 3 , … , v 11} ) .
o E represents the set of edges, which contains all possible edges between
the vertices.
n × ( n−1 )
o Using the formula: E= : where n is the number of vertices.
2
n=11
11× 10 110
o E= E= E=55
2 2
Question 2.
A University is conducting a conference for two days on different subjects for students
pursuing their higher education. Your task is to create a time slot scheduling model for the
conference sessions (based on the subjects attended by students) using graph coloring.
Draw the graph for the same and answer the chromatic number of this problem of
scheduling time slots with the number of subjects of your choice.
If we consider 4 subjects with 4 sessions each, leading to a total of 16 sessions per day for two
days (32 sessions in total), and edges between vertices represent students attending both sessions,
(Canva, 2024)
A 1 , A 2 , A 3 , A 4 , B 1 , B 2 , B 3 , B 4 , C 1 , C 2 ,C 3 ,C 4 , D 1 , D 2 , D 3 ,∧D 4.
Vertices A 1 , A 2 , A 3 , A 4 , B 1 , B 2 , B 3 , B 4 , C 1 , C 2 ,C 3 ,C 4 , D 1 , D 2 , D 3 ,∧D 4
Edges between vertices indicate students attending both sessions connected by the edge.
This graph illustrates the connections between sessions, showing where students attend multiple
sessions across the four subjects. Each vertex represents a specific session, and the edges
Question 3.
Explain Euler and Hamiltonian cycles and provide one simple counter example for each.
Find the Euler circuit/path and Hamiltonian cycle/path for the given graph G.
According to (GeeKsForGeeks, n.d.), “Eulerian Path is a path in graph that visits every edge
exactly once. Eulerian Circuit is a Eulerian Path which starts and ends on the same vertex.”
“Hamiltonian Cycle or Circuit in a graph G is a cycle that visits every vertex of G exactly once
and returns to the starting vertex.” Hamiltonian Path in a graph G is a path that visits every
vertex of G exactly once and Hamiltonian Path doesn’t have to return to the starting vertex. It’s
Find the Euler circuit/path and Hamiltonian cycle/path for the given graph G.
Question 4:
Explain the spanning tree. Find at least two possible spanning trees for the following graph
H and explain how you determined that they are spanning trees. Draw a bipartite graph
from any one of the two spanning trees that you found.
As noted by Lippman (2020), A spanning tree is a connected graph that includes all vertices and
has no cycles. In simpler terms, it's a graph where there's a path between any two vertices, but no
Draw a bipartite graph from any one of the two spanning trees that you found.
A Bipartite Graph is a graph that can be divided into two distinct sets, known as Bipartite Sets,
where edges exclusively link vertices from one set to vertices in the other set. This type of graph
lacks edges connecting vertices within the same set (Prepbytes, 2023).
References:
https://www.geeksforgeeks.org/eulerian-path-and-circuit/
https://byjus.com/maths/graph-theory/
https://www.youtube.com/watch?v=J6O9kis_pTw
v=UOE22pyKD5c
https://discrete.openmathbooks.org/dmoi3/sec_gt-intro.html
https://math.libretexts.org/Bookshelves/Applied_Mathematics/Math_in_Society_(Lippman)/
06%3A_Graph_Theory/6.07%3A_Spanning_Trees
https://www.prepbytes.com/blog/graphs/bipartite-graph-and-example/
Weisstein, E. W. (n.d.). Graph Loop. Mathworld.wolfram.com.
https://mathworld.wolfram.com/GraphLoop.html