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

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...

See similar textbooks

Similar questions

Draw a graph with six vertices and two bridges. A. OB. Oc. OD. acer
18
A forest contains 39 vertices and 36 edges. How many connected components does the graph have? → ▶
. How many edges does a complete graph K, have? Prove / explain your answer.
15. How many edges has each of the wheel graph W105? A. 210 B. 211 D. 209 D. 105
2. In the graph below, determine whether the following walks are trails, paths, closed walks, circuits, simple circuits, or just walks. b. vzvzV4V5 V2 c. VaVzV3 V4 V5 V2V4 e. VgUsU2V3 V4 V2U1 eg es
Consider the following portion of the London Tube (Underground) map as a graph with stops as vertices and the connecting lines (colored) as edges. Which of the following walks (listed as a sequence of tube stops) is not a cycle? Group of answer choices Charing Cross, Picadilly Circus, Green Park, Oxford Circus, Picadilly Circus, Charing Cross Charing Cross, Leicester Square, Tottenham Court Road, Oxford Circus, Picadilly Circus, Charing Cross Oxford Circus, Tottenham Court Road, Leicester Square, Picadilly Circus, Oxford Circus Picadilly Circus, Green Park, Oxford Circus, Tottenham Court Road, Leicester Square, Picadilly Circus
4. Suppose the city of Königsberg had the arrangement of islands and bridges pictured on the left instead of the arrangement that we introduced previously. Represent the map as graph. Would the citizens be able to complete a stroll across each bridge and return to their starting points without crossing the same bridge twice? Explain why or why not.
a. the number of edges in the graph, b. the number of vertices in the graph, c. the number of vertices that are of odd degree, d. whether the graph is connected, and e. whether the graph is a complete graph. 5.
2. A graph has vertices of degrees 0, 2, 2, 3, and 9. How many edges does the graph have?
Construct a connected bipartite graph that is not a tree with vertices A, B, C, D, E, F. What is the edge set? Construct a bipartite graph with vertices A, B, C, D, E, F such that the degree of D is 4. What is the edge set?