Networks Quiz

What are the lines called in a graph?

• Edges

• Vertices

• Nodes

• Points

What is a simple graph?

• A graph with no edges

• A graph with at most one edge between any pair of vertices

• A graph with only one vertex

• A graph with no loops

What is a connected graph?

• A graph with no loops

• A graph with at most one edge between any pair of vertices

• A graph where it is possible to reach every vertex by moving along the edges

• A graph with only one vertex

What is a bridge in a graph?

• An edge that connects two vertices

• An edge that, if removed, disconnects the graph

• An edge that forms a circuit

• An edge that has the highest weight

What is a directed graph?

• A graph with no loops

• A graph where it is only possible to move along the edges in one direction

• A graph with at most one edge between any pair of vertices

• A graph with only one vertex

What is the degree of a vertex?

• The number of edges directly connected to that vertex

• The number of vertices in the graph

• The sum of the degrees of all vertices

• The number of loops at a vertex

What does the handshaking theorem state?

• The sum of the degrees of the vertices is equal to the number of edges

• The sum of the degrees of the vertices is twice the number of edges

• The number of edges is equal to the sum of the degrees of the vertices

• The number of edges is twice the sum of the degrees of the vertices

What do isomorphic graphs have in common?

• Same number of vertices and edges

• Same number of vertices

• Same number of edges

• Same number of faces

What is an adjacency matrix?

• A matrix that represents the number of edges that connect the vertices of a graph

• A matrix that represents the weights of the edges in a graph

• A matrix that represents the degrees of the vertices in a graph

• A matrix that represents the number of loops in a graph

What is a planar graph?

• A graph with no intersecting edges

• A graph with only one vertex

• A graph with no loops

• A graph with at most one edge between any pair of vertices