1.1 How many simple graphs are there of four vertices? Draw all of them.

Advanced Engineering Mathematics
10th Edition
ISBN:9780470458365
Author:Erwin Kreyszig
Publisher:Erwin Kreyszig
Chapter2: Second-order Linear Odes
Section: Chapter Questions
Problem 1RQ
icon
Related questions
Question
1.1
How many simple graphs are there of four vertices? Draw all of them.
1.2
Deduce the number of simple graphs with n vertices.
Draw a graph modeling the relationships between the following Wikipedia articles: Chile,
Latin America, Beer, Mexican cuisine, and Olive oil. Is this graph dense or sparse?
1.3
1.4 The routing network of German cities below shows that each pair of distinct cities are con-
nected by a flight path. The weight of each edge is the flight distance in kilometers between
the two corresponding cities. In particular, there is a flight path connecting Karlsruhe and
Stuttgart. What is the shortest route between Karlsruhe and Stuttgart? Suppose we can
remove at least one edge from this network. How many possible ways are there to remove
edges such that, in the resulting network, Karlsruhe is no longer connected to Stuttgart via
a flight path?
Karlsruhe
197
Augsburg
Mannheim
57
72
Munich
383
Kassel
145
Frankfurt
149
97
Nuremberg
90
Würzburg
157
154
Stuttgart
Erfurt
Transcribed Image Text:1.1 How many simple graphs are there of four vertices? Draw all of them. 1.2 Deduce the number of simple graphs with n vertices. Draw a graph modeling the relationships between the following Wikipedia articles: Chile, Latin America, Beer, Mexican cuisine, and Olive oil. Is this graph dense or sparse? 1.3 1.4 The routing network of German cities below shows that each pair of distinct cities are con- nected by a flight path. The weight of each edge is the flight distance in kilometers between the two corresponding cities. In particular, there is a flight path connecting Karlsruhe and Stuttgart. What is the shortest route between Karlsruhe and Stuttgart? Suppose we can remove at least one edge from this network. How many possible ways are there to remove edges such that, in the resulting network, Karlsruhe is no longer connected to Stuttgart via a flight path? Karlsruhe 197 Augsburg Mannheim 57 72 Munich 383 Kassel 145 Frankfurt 149 97 Nuremberg 90 Würzburg 157 154 Stuttgart Erfurt
Expert Solution
steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Recommended textbooks for you
Advanced Engineering Mathematics
Advanced Engineering Mathematics
Advanced Math
ISBN:
9780470458365
Author:
Erwin Kreyszig
Publisher:
Wiley, John & Sons, Incorporated
Numerical Methods for Engineers
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…
Introductory Mathematics for Engineering Applicat…
Advanced Math
ISBN:
9781118141809
Author:
Nathan Klingbeil
Publisher:
WILEY
Mathematics For Machine Technology
Mathematics For Machine Technology
Advanced Math
ISBN:
9781337798310
Author:
Peterson, John.
Publisher:
Cengage Learning,
Basic Technical Mathematics
Basic Technical Mathematics
Advanced Math
ISBN:
9780134437705
Author:
Washington
Publisher:
PEARSON
Topology
Topology
Advanced Math
ISBN:
9780134689517
Author:
Munkres, James R.
Publisher:
Pearson,