Graph Theory Vocabulary Quiz � Identify Graph Types and Properties (HSS.ID.C.7)

1) A graph where vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other is called a __________ graph.

Bipartite

Regular

Simple

Multigraph

In bipartite graphs, no edges connect vertices within the same set.

Explanation

In bipartite graphs, no edges connect vertices within the same set.

2) A graph with exactly one cycle is called a __________ graph.

Unicyclic

Acyclic

Multigraph

Planar

Unicyclic graphs contain exactly one cycle, with the rest forming a tree structure.

Explanation

Unicyclic graphs contain exactly one cycle, with the rest forming a tree structure.

3) A graph where multiple edges between the same pair of vertices are allowed is called a __________.

Multigraph

Pseudograph

Weighted graph

Regular graph

Multigraphs allow parallel edges but do not necessarily include loops.

Explanation

Multigraphs allow parallel edges but do not necessarily include loops.

4) A graph whose edges have directions is called a __________ graph.

Directed

Weighted

Planar

Complete

In directed graphs, each edge has an orientation from one vertex to another.

Explanation

In directed graphs, each edge has an orientation from one vertex to another.

5) A graph with loops allowed (edges from a vertex to itself) is called a __________.

Pseudograph

Multigraph

Directed graph

Planar graph

Pseudographs allow both loops and multiple edges.

Explanation

Pseudographs allow both loops and multiple edges.

6) A graph where every pair of vertices is connected by exactly one edge is called a __________.

Complete graph

Connected graph

Regular graph

Bipartite graph

A complete graph has all possible edges between distinct vertices.

Explanation

A complete graph has all possible edges between distinct vertices.

7) A graph with no cycles is called a __________.

Tree

Forest

Planar

Chain

Trees are connected graphs without cycles.

Explanation

Trees are connected graphs without cycles.

8) A graph that can be drawn without any edges crossing is called a __________ graph.

Planar

Bipartite

Simple

Directed

Planar graphs can be embedded in a plane without overlapping edges.

Explanation

Planar graphs can be embedded in a plane without overlapping edges.

9) A graph with all vertices having the same degree is called a __________ graph.

Regular

Simple

Balanced

Uniform

In a regular graph, each vertex has the same number of incident edges.

Explanation

In a regular graph, each vertex has the same number of incident edges.

10) A graph with no edges is called a __________.

Empty graph

Null graph

Simple graph

Trivial graph

An empty graph has vertices but no edges.

Explanation

An empty graph has vertices but no edges.

Graph Theory

1) A graph where vertices can be divided into two disjoint sets such that every edge connects a vertex in one set to a vertex in the other is called a __________ graph.

2)

What first name or nickname would you like us to use?

2) A graph with exactly one cycle is called a __________ graph.

3) A graph where multiple edges between the same pair of vertices are allowed is called a __________.

4) A graph whose edges have directions is called a __________ graph.

5) A graph with loops allowed (edges from a vertex to itself) is called a __________.

6) A graph where every pair of vertices is connected by exactly one edge is called a __________.

7) A graph with no cycles is called a __________.

8) A graph that can be drawn without any edges crossing is called a __________ graph.

9) A graph with all vertices having the same degree is called a __________ graph.

10) A graph with no edges is called a __________.