answersLogoWhite

0

A line graph.

The y-axis would be speed;

For the x-axis, it could be time (showing how the speed varies with time [so far] of the ride).

The x-axis could also use distance as the track will be of a fixed length (showing how the speed varied with distance [travelled so far] on the ride), but the question refers to the two minutes of the ride, hence the suggestion above.

User Avatar

Wiki User

9y ago

What else can I help you with?

Related Questions

Which is the best type of graph to model the speed of a roller coaster over the full two minutes it takes to complete the ride?

A discrete graph. A discrete graph is a visual function that displays data that generally represents counts of things.


Is the complete graph on 5 vertices planar?

No, the complete graph of 5 vertices is non planar. because we cant make any such complete graph which draw without cross over the edges . if there exist any crossing with respect to edges then the graph is non planar.Note:- a graph which contain minimum one edge from one vertex to another is called as complete graph...


Which type of graph would be best to measure in minutes?

The best graph for minutes would probably be a line or bar graph to measure something over time. Your welcome!


How do you complete a circle graph?

you fill it in


Is finding the longest path in a graph an NP-complete problem?

Yes, finding the longest path in a graph is an NP-complete problem.


How many triangles are there in a complete graph?

The number of triangles in a complete graph with n nodes is n*(n-1)*(n-2) / 6.


What is the automorphism group of a complete bipartite graph?

The automorphism group of a complete bipartite graph K_n,n is (S_n x S_n) semidirect Z_2.


Is automorphism of complete graph is a symmetric group?

Yes!


Is it possible to have a complete graph with 46 363 edges?

No.


How do you graph converting minutes to hours?

60minutes equal a hour.


How many perfect matchings are there in a complete graph of 6 vertices?

15


What is the complexity of solving the k-color problem on a given graph?

The complexity of solving the k-color problem on a given graph is NP-complete.