1. An “X" in the table below indicates a dírect train route between the corresponding cities. Draw a graph that represents this information, in which each vertex represents a city and an edge connects two vertices if there is a train route between the corresponding cities. Springfield Riverside Greenfield Watertown Midland Newhope Springfield X X Riverside X X X Greenfield X Watertown Midland X X X - Newhope X 2. A group of friends is represented by the graph at the right. An edge connecting two names means that the two friends have spoken to each other in the last week. Michael John e a) Have John and Stacy talked to each other in the last week? b) How many of the friends in this group has Steve talked to in the last week? c) Among this group of friends, who has talked to the most people in the last week? Steve Erin Stacy d) Why would it not make sense for this graph to contain a loop? Ada

A First Course in Probability (10th Edition)
10th Edition
ISBN:9780134753119
Author:Sheldon Ross
Publisher:Sheldon Ross
Chapter1: Combinatorial Analysis
Section: Chapter Questions
Problem 1.1P: a. How many different 7-place license plates are possible if the first 2 places are for letters and...
icon
Related questions
Question

1. An “X” in the table below indicates a direct train route between the corresponding cities. Draw a graph that
represents this information, in which each vertex represents a city and an edge connects two vertices if there
is a train route between the corresponding cities.

2. A group of friends is represented by the graph at the right. An edge connecting
two names means that the two friends have spoken to each other in the last
week.
a) Have John and Stacy talked to each other in the last week?
b) How many of the friends in this group has Steve talked to in the last week?
c) Among this group of friends, who has talked to the most people in the last
week?
d) Why would it not make sense for this graph to contain a loop?

PROBLEMS:
1. An “X" in the table below indicates a direct train route between the corresponding cities. Draw a graph that
represents this information, in which each vertex represents a city and an edge connects two vertices if there
is a train route between the corresponding cities.
Springfield
Riverside
Greenfield
Watertown
Midland
Newhope
Springfield
X
Riverside
X
X
Greenfield
X
-
Watertown
X
X
Midland
X
X
X
Newhope
X
X
X
|
2. A group of friends is represented by the graph at the right. An edge connecting
two names means that the two friends have spoken to each other in the last
week.
Michael
John
a) Have John and Stacy talked to each other in the last week?
b) How many of the friends in this group has Steve talked to in the last week?
c) Among this group of friends, who has talked to the most people in the last
week?
Steve
Erin
Stacy
d) Why would it not make sense for this graph to contain a loop?
Ada
Transcribed Image Text:PROBLEMS: 1. An “X" in the table below indicates a direct train route between the corresponding cities. Draw a graph that represents this information, in which each vertex represents a city and an edge connects two vertices if there is a train route between the corresponding cities. Springfield Riverside Greenfield Watertown Midland Newhope Springfield X Riverside X X Greenfield X - Watertown X X Midland X X X Newhope X X X | 2. A group of friends is represented by the graph at the right. An edge connecting two names means that the two friends have spoken to each other in the last week. Michael John a) Have John and Stacy talked to each other in the last week? b) How many of the friends in this group has Steve talked to in the last week? c) Among this group of friends, who has talked to the most people in the last week? Steve Erin Stacy d) Why would it not make sense for this graph to contain a loop? Ada
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
Paths and Circuits
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, probability and related others by exploring similar questions and additional content below.
Similar questions
Recommended textbooks for you
A First Course in Probability (10th Edition)
A First Course in Probability (10th Edition)
Probability
ISBN:
9780134753119
Author:
Sheldon Ross
Publisher:
PEARSON
A First Course in Probability
A First Course in Probability
Probability
ISBN:
9780321794772
Author:
Sheldon Ross
Publisher:
PEARSON