Discrete Math Final Exam Review Question and answers
100% correct v 2026
Study online at
edges
connect the vertices by lines
vertices
or curves diagram of dots
degree # of times an edge touches it
4. indegree # of edges coming into the vertex
5. outdegree # of edges going out of the vertex
6. directed graph Uses arrows
7. undirected graph Graph that does not use arrows and is not directed
8. coloring An assignment of ditterent values(colors) to each vertex such that no 2
vertices of the same color share an edge
9. planar graph If the graph can be written down without any edges crossing each other
10. Complete graph A simple graph in which every pair of vertices is connected by an edge
11. connected graph An undirected graph; if there is a path connecting any 2 vertices
12. Tip about If all the vertices have an even degree, then it is a euler circuit.
euler circuits
13. Tip about
euler paths If a graph has more than two vertices of odd degree, then there is no euler
path.
14. set a collection of elements
15. equal sets Sets containing the same elements
16. subsets Sets that exist within a larger set
17. empty set
1/
4
100% correct v 2026
Study online at
edges
connect the vertices by lines
vertices
or curves diagram of dots
degree # of times an edge touches it
4. indegree # of edges coming into the vertex
5. outdegree # of edges going out of the vertex
6. directed graph Uses arrows
7. undirected graph Graph that does not use arrows and is not directed
8. coloring An assignment of ditterent values(colors) to each vertex such that no 2
vertices of the same color share an edge
9. planar graph If the graph can be written down without any edges crossing each other
10. Complete graph A simple graph in which every pair of vertices is connected by an edge
11. connected graph An undirected graph; if there is a path connecting any 2 vertices
12. Tip about If all the vertices have an even degree, then it is a euler circuit.
euler circuits
13. Tip about
euler paths If a graph has more than two vertices of odd degree, then there is no euler
path.
14. set a collection of elements
15. equal sets Sets containing the same elements
16. subsets Sets that exist within a larger set
17. empty set
1/
4
