Scribd
Upload
156 views6 pages

The Mathematics of Graphs

Here are the answers to the supplementary exercises: 1. The chromatic number of the wheel of order six is 3. 2. The chromatic number of the Konigsberg Bridge graph is 4. 3. The graph in Figure 11.84 is not 2-colorable. 4. To determine the minimum number of time schedules required, we can model the problem as a graph coloring problem. By representing each committee as a vertex and connecting committees that share members with edges, the chromatic number of this graph gives the minimum number of time schedules needed. Since some committees share 3 or more members, the chromatic number is at least 3. Therefore, the minimum number of time schedules required is 3.

Uploaded by

Jebbrys Largo
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
156 views6 pages

The Mathematics of Graphs

Here are the answers to the supplementary exercises: 1. The chromatic number of the wheel of order six is 3. 2. The chromatic number of the Konigsberg Bridge graph is 4. 3. The graph in Figure 11.84 is not 2-colorable. 4. To determine the minimum number of time schedules required, we can model the problem as a graph coloring problem. By representing each committee as a vertex and connecting committees that share members with edges, the chromatic number of this graph gives the minimum number of time schedules needed. Since some committees share 3 or more members, the chromatic number is at least 3. Therefore, the minimum number of time schedules required is 3.

Uploaded by

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

CHAPTER 10

T HE M A THEM A T IC S
OF G RA P HS
BSCE-1A
GROUP 9
LEARNING OBJECTIVES
• Determining the edges, vertices, order, size, degree vertices, and degree sequence of a graph.
• Identify the adjacent and incident on vertices and edges of a graph.
• Construct different types of graphs.
• Distinguish the difference between a bipartite and a complete bipartite graph.
• Find the complement of a simple graph and complete bipartite graph.
• Differentiate walk, trail, path, circuit, and cycle.
• Show the two given graphs are isomorphic.
• Determine whether a graph is planar or nonplanar.
• Use Euler’s formula to determine planarity of a graph.
• Determine whether a graph is Eulerian, semi-Eulerian and non-Eulerian.
• Explore the applications of graphs.

CHAPTER OUTLINE
Unit 10.1: Basic Concepts
Unit 10.2: Graphs and Euler Circuits
Unit 10.3: Weighted Graphs
Unit 10.4: Euler’s Formula
Unit 10.5: Graph Coloring
UNIT 10.1: BASIC CONCEPTS
A. Introduction
Graph theory is a branch of mathematics concerned with networks of points connected
by lines. It is also defined as the study of graphs and its mathematical structures. It is used
to model pairwise relations between objects from a certain collection. Graph theory started
in recreational math problems but it has grown into a significant area of mathematics with
applications in computer science, social sciences, chemistry, operations research, and in
other fields.
In the field of computer science, graphs are used to represent networks of
communication, data organization, computational devices, the flow of computation, and
others. One good example is the link structure of a certain website which could be
represented by a direct graph. The vertices are the web pages at the website and a directed
edge from page X to page Y exists if and only if page X contains a link to page Y.
UNIT 10.1: BASIC CONCEPTS
We will begin with some definition on the basic terms used in graph theory before we introduce the
types of graphs.
A graph G consists of a non-empty finite set V(G) of elements called vertices (or nodes), and a finite
E(G) of unordered pairs (not necessary distinct) called edges (or edge family). The vertex set is denoted
as V(G) and the edge set is denoted as E(G) of graph G. Note that V(G) = {v1, v2, v3, …, vn} and E(G) =
{e1, e2, e3, …, en}, where v1 is for the vertices and e1 is for the edges. The graph in Figure 10.1 shows
that the set V(G) = {v1, v2, v4, v5} and E(G) = {e1, e2, e3, e4, e5, e6}.
One example of graph is shown in Figure 10.2. The set of vertices of graph G and edge family G is
reflected below: V(G) = {u, v, x, y, z} and E(G) = {uv, vx, xz, yz, uy, vy, uz, vz} = {e1, e2, e3, e4, e5, e6, e7,
e8}.
UNIT 10.1: BASIC CONCEPTS
The order of the graph is number of vertices and its size is determined by counting
the number of edges in a graph. Let us consider Figure 10.2, the order of graph G is 5
and while its size is 8. In addition, the graph G in Figure 10.3 has an order of 6 with a
size of 9.
Two vertices of graph G are adjacent (or neighbors) if there is an edge joining them,
and the edge joining them is called an incident. Likewise, two distinct edges are adjacent
if they have a vertex in common, and the vertex is the connecting the edges is called the
incident.
Given a graph as shown in Figure 10.4, vertex a and vertex b are adjacent to each
other since it is being connected by an edge ab; ab serves as an incident to vertex a and
vertex b. Also edges ab and bc are adjacent since there is a vertex b connecting them;
vertex b serves as an incident to edges ab and bc. Alternatively, vertex a and vertex d are
not adjacent because there is no edge connecting the two vertices.
UNIT 11.5: GRAPH COLORING

Supplementary Exercise 10.5


1. Find the chromatic number of the “wheel of order six”.
2. Determine the chromatic number of the Konigsberg Bridge graph.
3. Determine whether the graph in Figure 11.84 is 2-colorable.
4. Eight different office committees want to schedule a meeting on the last day of July. Some committee members
belong to more than one of these committees, so committees that share members cannot meet at the same time.
How many different time schedules are required so that members can attend all meetings?

You might also like