1) Create 1 problem. Problem must REALISTIC and LOCALIZED, within the place (province or municipality) where you live as of the moment. Note: I live on the Negros Islands in the Philippines so any problem about shipping or farming will do. Thank you 2) Design your own problem and graph that have a practical value. 3) Identify the vertices and conditions for the adjacency of the vertices. Come up with your analysis of the graph. The graph must be a weighted graph.
1) Create 1 problem. Problem must REALISTIC and LOCALIZED, within the place (province or municipality) where you live as of the moment. Note: I live on the Negros Islands in the Philippines so any problem about shipping or farming will do. Thank you 2) Design your own problem and graph that have a practical value. 3) Identify the vertices and conditions for the adjacency of the vertices. Come up with your analysis of the graph. The graph must be a weighted graph.
Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
Related questions
Question
Note: kindly make it look something like the provided image
Graph Theory:
1) Create 1 problem. Problem must REALISTIC and LOCALIZED, within the place (province or municipality) where you live as of the moment. Note: I live on the Negros Islands in the Philippines so any problem about shipping or farming will do. Thank you
2) Design your own problem and graph that have a practical value.
3) Identify the vertices and conditions for the adjacency of the vertices. Come up with your analysis of the graph. The graph must be a weighted graph.
Transcribed Image Text:ANSWER!
@
Since we have cities, then we can draw 5 dots. These dots will be represented as Vertices.
Note that weights here are in km. Consider the first row, there is no such thing as distance from
Avoca to Avoca, that's why this is being left as blank. From Avoca to Bicheno, it takes 66 km
to travel. From Avoca, it has a distance of 62 km to Oatlands. And so on.
Here is the graph:
A
91
66
B
D
LEGEND:
A - Avoca
B- Bichens
D - Oatlands
D - Diver
R- Roseberry
27
62
127
160
49
0
R
Questions to Answer:
Find Possible routes from Roseberry to Oatlands. (Visiting all cities once).
Ans: R-D-A-B = 0 =
R-A-D-B-D =
233 (total distance in kin)
405 (total distance in km)
304 (total clistance in km)
R-D-B-A -0 =
2) Give the route that gives
(Visiting all cities once)
shortest distance from Roseberry to Oatlands.
Ans: R-D-A-B-0
3) Route with longest distance from Roseberry to Oatlands. (Visiting all cities once)
Ans: R-A-D-B-0
Expert Solution
This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 3 steps with 2 images
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
Advanced Math
ISBN:
9780073397924
Author:
Steven C. Chapra Dr., Raymond P. Canale
Publisher:
McGraw-Hill Education
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
