Solution Found!
Consider the following game. You are given N vertices and are required to build a graph
Chapter 5, Problem 62(choose chapter or problem)
Consider the following game. You are given N vertices and are required to build a graph by adding edges connecting these vertices. Each time you add an edge you must pay $1. You can stop when the graph is connected. (a) Describe the strategy that will cost you the least amount of money. (b) What is the minimum amount of money needed to build the graph? (Give your answer in terms of N.)
Questions & Answers
QUESTION:
Consider the following game. You are given N vertices and are required to build a graph by adding edges connecting these vertices. Each time you add an edge you must pay $1. You can stop when the graph is connected. (a) Describe the strategy that will cost you the least amount of money. (b) What is the minimum amount of money needed to build the graph? (Give your answer in terms of N.)
ANSWER:Step 1 of 2
(a)
If we connect vertex with vertex , vertex with vertex , etc. Until we connect vertex with vertex , then we have a connected graph with edges.