Home

Chapter5:

Matching Quiz #3

Matching Quiz #3
Complete the following matching items dealing with Euler Circuits.

This activity contains 1 question.

	Match the name of the item to the description relating to a given graph G. Using the pull-down menus, match each item in the left column to the corresponding item in the right column. adjacent edges connected graph edge degree loop bridge adjacent vertices path circuit vertex 1.1 Any edge which starts and ends at the same vertex. A B C D E F G H I J 1.2 Any edge which disconnects the graph when deleted. A B C D E F G H I J 1.3 Any line joining two verticies of the graph. A B C D E F G H I J 1.4 The point where two or more edges meet. A B C D E F G H I J 1.5 The number of edges which meet at a given vertex. A B C D E F G H I J 1.6 Two edges of a graph are connected by a common vertex. A B C D E F G H I J 1.7 Two vertices joined by a single edge A B C D E F G H I J 1.8 Any sequence of adjacent edges which appear only once. A B C D E F G H I J 1.9 A sequence of adjacent vertices which start and end at the same place. A B C D E F G H I J 1.10 A graph where any two vertices are joined by a path. A B C D E F G H I J

Copyright © 1995-2008, Pearson Education, Inc., publishing as Pearson Prentice Hall Legal and Privacy Terms