Names:

Adlawan, Renavie
Alcosero, Agnes Therese
Bayon-on, Allana
Cabalinan, Danah Joyce
Caricari, Lexi
Time: TTH (1:30- 3:00 PM) Performance Task Module 5
1.0 Statement of the problem
Bantayan Island is a small island located in the Visayan Sea, off the coast of the
northernmost tip of Cebu Island in the Philippines. It is known for its crystal-clear
waters, fine white sand beaches, and laid-back atmosphere, making it a perfect
destination for travelers looking to escape the hustle and bustle of city life. Based on
the given data above, it would be easy to assume that the fishing industry is the major
source of Bantayanon’s livelihood. Yet unbeknownst to the majority, Bantayan’s main
line of business is actually poultry (being the “egg basket” of Visayas), piggeries and
other agricultural businesses.

The Local Government Unit of Bantayan decided to hold symposiums or seminars for
each agricultural business. Symposium was made specified, one for each livelihood,
in order to ensure the quality of the seminar as it would only focus on one topic. The
speakers are all the same in every barangay. Thus, each barangay will be given only
half day to conduct the said symposiums, such that all 49 barangays in the Island will
be catered in less than a month.
In Barangay Mojon, there are 6 agricultural businesses. In order to cater all 6 business
symposiums in half day, there must be symposiums that would take place at the same
time. The owners of the businesses own more than one livelihood business. The
Barangay officials then decided to utilize the said data and use the graph theory to
schedule seminars that would take place at the same time while ensuring that the
businessmen can attend all the symposiums with regards to the businesses that they
own. The data is shown in the table below, X represents that the certain business is
owned by the same businessman.

1.0 Reason for this proposed problem

Livelihoods contribute to food security, prevent dependency, reduce vulnerability,
enhance self-reliance and can develop or build a set of specific skills during displacement.
Having the said Symposiums will not only improve the businesses and livelihood of the
Bantayanons but would also impact Bantayan’s local economy positively.The LGU has
plenty of work to do, that is why it is important to make sure that time is managed
effectively while also ensuring that the said symposiums are of quality. With this, the graph
theory is of big help. It reminds people that goals can be achieved easier without
consuming a lot of time.
 LIVELIHOOD GOAT PIG POULTRY CORN COW BANTRESS
BUSINESS
Goat Raising X X X X
Piggery X X
Poultry Farm X X X
Corn Crop X X X
Farming
Cow Raising X X
Bantress X X X X
Raising

2.0 Proposed Solution

Based on the information given in the problem, we have created a graph that
depicts the data in it. The vertices represent the livelihood business, and the edge
between two vertices shows that there are owners who own the same business.
Consequently, the graph can resemble the one below:

Corn Crop Farming

Piggery Poultry Farm

Goat
Raising

Cow Bantress
Raising Raising

We will now begin calculating the chromatic number using this graph. Coloring the
vertices of a graph in such a way that no two vertices connecting an edge to the first
colored vertex have to be the same color is known as vertex coloring. It is necessary to
determine its chromatic number in order to divide the group based on the availability of
schedules for each owner to attend the symposium.

Step 1.
Let us make a table that would determine the number of degrees for each vertex.
VERTICES DEGREE
Goat Raising 4
Piggery 2
Poultry Farm 3
Corn Crop Farming 3
Cow Raising 2
Bantress Raising 4

Step 2.
The vertex with the highest degree is recognized, and in order to distinguish it from
other vertices, we give it a color. We can use the same color for the other vertices as long
as it does not match the color of a vertex that is adjacent to the vertex we just colored.

Corn Crop Farming

Piggery Poultry Farm

Goat
Raising

Cow Bantress
Raising Raising

Any color would do. But we have chosen red as our first color.
 Since the only vertex not linked with the vertex Goat Raising is the vertex Corn
Crop Farming, we can color it the same color as the Goat Raising vertex, which is red.
Step 3.
The remaining uncolored vertices are then given a different color, making sure not
to give them the same color as a connecting vertex. We decided on yellow this time.

Corn Crop Farming

Piggery Poultry Farm

Goat
Raising

Cow Bantress
Raising Raising

Here, the vertex Bantress Raising ought to be colored as well, since it also has the
highest degree. Given that Bantress Raising and Goat Raising are connected vertices,
Bantress Raising ought to be given a different color. Yellow is the selected color. The
vertex Piggery can also have the same color applied (yellow), as it is not linked to the
vertex Bantress Raising.

Step 4.
 Since there are still uncolored vertices left, we must choose another color to fill
them with. We choose green as the third color.
Corn Crop Farming

Piggery Poultry Farm

Goat
Raising

Cow Bantress
Raising
RaisingSince the remaining vertices Cow Raising and Poultry Farm are not connected,
assigning both with the same color is applicable.
Finally, the three colors are identified: red, yellow, and green. With this, we find out
that the chromatic number is three.
Now that we have determined the chromatic number for this problem’s graph, we
discovered that we need a minimum number of three schedules for the symposium to be
attended by the business owners, so that they can attend different symposiums about
their business without conflict. Below is the possible livelihood business scheduled by
time slots:

TIME LIVELIHOOD BUSINESS

8:00 AM – 9:00 AM Goat Raising, Corn Crop
Farming
9:30 AM – 11:00 AM Poultry Farm, Cow Raising
11:00 AM – 12:30 PM Piggery, Bantress Raising

Therefore, all 6 business symposiums can take place by assigning a one-time schedule
on businesses who are not linked. The minimum number of time schedules is 3, it was
known by using Graph coloring. Graph coloring is one of the most useful techniques for
assigning different colors to adjacent vertices. The minimum number of colors used for
the correct coloring of the graph is our goal which is an optimization problem. Graph
theory is all about studying the relationships between different nodes (vertices) and
connections (edges), through the application of this theory, it gives us solutions to a
broad spectrum of layout, networking, optimization, matching, and operating concerns.
In our problem, the problem is represented graphically by a graph whose vertices
correspond to the livelihood businesses (Goat Raising, Corn Crop Farming, Poultry
Farm, Cow Raising, Piggery, Bantress Raising). And though a problem arises at first
because of a time limit, to conduct all 6 symposiums in a span of a half day. It was a
difficult task at first, but because of graph theory (graph coloring), a better and easier
way was found. Time was optimized and the goal was achieved. From this problem-
solution, we are reminded to think about problems the way graph theory does:
"Abstract the problem & remove all unimportant parts behind, this will make the search
for a solution much easier. "