You are not logged in.
Pages: 1
Suppose that an airline oers daily non stop flights as follows: there are three flights from New York
to Miami, two flights from Miami to New York, one flight from Miami to Chicago, two flights from
Chicago to Miami, 3 flights from Chicago to New York, 3 flights from New York to Chicago, one
flight from New York to Houston, and one flights from Houston to New York, two
flights from Houston toMiami, and one flight from Miami to Houston.
(a) Draw a graph to represent airline routes, in which each vertex represents a city and an edge joining
two vertices represents the existence of a non stop flight between those two cities.
(b) Find the beta index of the graph you found in part (a).
Offline
Hi Dharshi;
Did you form your adjacency matrix?
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
No i didnt get any idea but they have asked to solve it using graph theory
Offline
One way of using graph theory is actually to draw the graph, surely you were taught that. You first form an adjacency matrix and then construct the graph.
In mathematics, you don't understand things. You just get used to them.
If it ain't broke, fix it until it is.
Always satisfy the Prime Directive of getting the right answer above all else.
Offline
Pages: 1