Graph Theory

3. A fundamental unit in a graph, typically represented by as a point.
5. The minimum number of colors needed to color the vertices of a graph so that no two adjacent vertices share the same color.
8. A graph that has a vertex of degree 0
9. The number of edges incident to a vertex.
10. A graph that does not contain any loops or parallel edges
11. Two or more edges hat connect the same pair of vertices.
13. A connection between two vertices in a graph

1. The number of vertices in a graph
2. The distance between two vertices in terms of the number of edges
4. A graph that contains all possible edges between its vertices
5. A closed path where the starting and ending vertices are the same.
6. A property of a graph where there exits a path between every pair of vertices
7. An edge that connects a vertex to itself.
12. Vertices that share an edge
14. A graph where each edge has a direction.