Kayla Czarina Natividad

GE 4 - B
1. Differentiate Connected and Disconnected Graph.

In graph theory, a connected graph is a graph in which all of the vertices are somehow connected
to each other and a disconnected graph is a graph that can be broken up into two or more
separate graphs.

2. Give an example on each from question 1 by drawing a graph.

3. How many vertices have you created from a Connected Graph?

In a connected graph, the number of vertices can vary depending on the specific graph. However,
there must be at least two vertices in order for a graph to be considered connected.

4. How many vertices have you created from a Disconnected Graph?

In a disconnected graph, the number of vertices can also vary, but there must be at least two
vertices in each group of vertices that are not connected to each other.

5. How many edges formed from a Connected Graph?

The number of edges in a connected graph can also vary depending on the specific graph.
However, there must be at least one edge in order for a graph to be considered connected. The
formula for the maximum number of edges in a connected graph with n vertices is (n*(n-1))/2.

6. How many edges formed from a Disconnected Graph?

The number of edges in a disconnected graph can also vary, but there must be at least one edge
in each group of vertices that are not connected to each other. The formula for the maximum
number of edges in a disconnected graph with n vertices is the sum of the maximum number of
edges in each connected component of the graph.