Scribd
Upload
62 views3 pages

Mathematical Modeling Tutorial

The document discusses mathematical modeling concepts and provides examples of graph theory problems involving vertices, edges, degrees, adjacency matrices, and scheduling optimization. Graphs are used to model bridges, roads and exam scheduling. Problems involve finding shortest and least expensive paths between cities on graphs.

Uploaded by

T Sukan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
62 views3 pages

Mathematical Modeling Tutorial

The document discusses mathematical modeling concepts and provides examples of graph theory problems involving vertices, edges, degrees, adjacency matrices, and scheduling optimization. Graphs are used to model bridges, roads and exam scheduling. Problems involve finding shortest and least expensive paths between cities on graphs.

Uploaded by

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

Faculty of Technology

Wayamba University of Sri Lanka


Higher Diploma in Construction Productivity Management (HDCPM)
Batch 1 Semester II
HDCPM 323 - Mathematical Modeling for Technology
Tutorial # 03

1. (a) Find the degrees of the vertices in the graphs G and H displayed in Figure.

(b) Find the in-degree and out-degree of each vertex in the graph G with directed
edges shown in Figure.

(c) How many more edges are there in the complete graph K7 than in the complete
graph K5 .
(d) How many edges are there in a graph with 10 vertices each of degree six?
(e) Are the graphs G and H displayed in Figure bipartite?

 
0 1 1 0
1 0 0 1
(f) Draw a graph with the adjacency matrix 
1
 with respect to the order-
0 0 1
0 1 1 0
ing of vertices a, b, c, d.

1
 
0 3 0 2
3 0 1 1
(g) Use the following adjacency matrix to represent the pseudograph. 
0

1 1 2
2 1 2 0
(h) Represent the graphs shown in Figure with an incidence matrix.

2. The bridges and land masses of a certain city can be modeled with graph G in Figure.

(a) Is G Eulerian? Why or why not?


(b) Suppose we relax the requirement of the walk so that the walker need not start
and end at the same land mass but still must traverse every bridge exactly once.
Is this type of walk possible in a city modeled by the graph in Figure? If so, how?
If not, why not?

2
3. The Mathematics Department at a small college plans to schedule final examinations.
The class rosters for all the upper-class math courses are listed in Table. Find an exam
schedule that minimizes the number of time periods used.

4. The weighted graphs in the figures here show some major roads in New Jersey. Part
(a) shows the distances between cities on these roads; part (b) shows the tolls.

(a) Find a shortest route in distance between Newark and Camden, and between
Newark and Cape May, using these roads.
(b) Find a least expensive route in terms of total tolls using the roads in the graph
between the pairs of cities in part (a) of this exercise.

You might also like