Graphs and Networks

What is a graph called if it has no direction indicated on each edge?

• Directed

• Undirected

• Weighted

• Bipartite

In a directed graph, what are the directed edges called?

• Loops

• Arcs

• Faces

• Vertices

What is the degree of a vertex in a complete graph with n vertices?

• n + 1

• n - 1

• n

• 2n

What type of graph is a graph without any loops or multiple edges?

• Complete graph

• Simple graph

• Bipartite graph

• Weighted graph

What is a graph called where every vertex is connected to every other vertex?

• Simple graph

• Complete graph

• Bipartite graph

• Weighted graph

What is a graph called where any vertex is reachable from any other vertex?

• Connected graph

• Disconnected graph

• Simple graph

• Weighted graph

What is a bridge in a graph?

• An edge that keeps a graph connected

• A vertex that connects two edges

• A loop in a graph

• A face in a planar graph

What is Euler’s formula for planar graphs?

• v + e - f = 2

• v + f - e = 2

• v - f + e = 2

• v - e + f = 2

What is a bipartite graph?

• A graph with loops

• A graph with multiple edges

• A graph with vertices separated into two distinct sets

• A graph with no edges

What is a weighted graph?

• A graph with no direction

• A graph with extra information on edges

• A graph with multiple loops

• A graph with no vertices