MTH/221 WEEK 4 DQs
*BRAND NEW TUTORIAL JUNE 2014*
MTH/221 WEEK 4 DQ#1
Hamiltonian and Euler Graphs
Here is another Chapter 10 Question: Note a Hamiltonian circuit visits each
vertex only once but may repeat edges. A Eulerian graph traverses every edge
onc
Discrete Mathematics Projects
CHECKER TOURNAMENT
Goals
(1) Students will explore the concept of graph theory as it relates to scheduling.
(2) Students will derive a schedule to meet all the criteria of the tournament.
(3) Students will explain and justify
Score: 140/140 Points 100 %
Determine whether the given graph has an Euler circuit. Construct such a circuit when one exists. If no Euler
circuit exists, determine whether the graph has an Euler path and construct such a path if one exists.
VI
A
Reference
Score: 140/140 Points 100 %
Consider the given directed multigraph.
a b
Q
d' c
References
Section Break Chapter: 10 Graphs Section: 10.02 Graph Terminology and Special Types of
Graphs
Award: 3.88 out of 3.88 polnts
a) What is the number of vertices for th
Score: 140/140 Points 100 %
Consider the six bridges graph
References
Section Break Chapter: 10 Graphs Section: 10.05 Euler and Hamilton Paths
2 3 . Award: 3.88 out of 3.88 points
How many vertices have odd degree in the graph that models the bridges in
Score: 140/140 Points 100 %
Consider the graph
1 _ Award: 3.88 out of 3.88 points
a) Identify the type of graph.
0 Mixed graph
0 Pseudograph
O Multigraph
o . Simple graph
A graph in which each edge connects two different vertices and where no two edges co
1. a) Identify the type of graph.
Simple graph
2. b) Identify the true statement about the graph shown.
It has no parallel edges and no loops.
3. Does the graph have directed edges?
No
4. N/A
5. N/A
6. N/a
7. What is the number of vertices for the given g
1. Identify the steps that are used to find the maximum element from the following finite
sequence 1, 8, 12, 9, 11, 2, 14, 5, 10, 4.
max := 1, i := 2,
max := 8, i := 3,
max := 12, i := 4, i := 5, i := 6, i := 7,
max := 14, i := 8, i := 9, i := 10, i := 11
1.
2.
3.
4.
5.
6.
7.
8.
9.
10.
11.
12.
13.
14.
15.
16.
17.
18.
19.
20.
21.
22.
This is not a proposition; its a command.
No
This is a proposition., Its truth value is false, as anyone who has been to Maine knows.
False
This is a proposition that is false.
1
Coding Theory
Julious Campbell
MTH/221
May 02, 2016
Terence Yi
2
Coding Theory
In todays world there are many applications that use Error Coding for their many digital
process and code. Some of the many areas where this technology is use is (Computer, m
1. A particular brand of shirt comes in 8 colors, has a male version and a female version,
and comes in 5 sizes for each sex. How many different types of this shirt are made?
80
Comment:
By the product rule there are 825=80different types of shirts.
2. A
Running head: FOOD WEB CASE STUDY PAPER
1
Food Web Case Study Paper
Clarence D. Spence
MTH / 221
April 28, 2015
David Gobeli
FOOD WEB CASE STUDY PAPER
2
Food Web Case Study Paper
In this paper, this student completes the following: First, this student wil
Title:
MTH221 / MTH 221 / Week 3 Textbook Exercises
Description:
Chapter 7 sections 7 and 8 preview:
(please scroll down and follow instructions to get your document)
Please go to this link to access your document:
http:/www.mediafire.com/view/auno91ngne2