Exam 13: Sets and Maps

An ______ graph is a graph where the pairings representing the edges are unordered.

An undirected graph is considered complete if it has the ______ number of edges connecting vertices.

What is the definition of path? Of cycle?

What is the difference between a network and a graph?

A cycle is a path in which the first and last vertices are ______ and none of the edges are repeated.

A graph is connected if and only if the number of vertices in the __________ traversal is the same as the number of vertices in the graph regardless of the starting vertex.

A ______, sometimes referred as a digraph, is a graph where the edges are ordered pairs of vertices.