Vertex - an object/place represented by a dot

Edge - a connection between two vertices represented by a line

Faces - inclosed areas +1 for the outside

an edge, that connects a vertx back to its self, without going through any other vertex.

a graph that does not contain a loop or multiple edges

The degree of a vertex is the number of edges connected to a vertex.
A loop counts as two edges for the degree.

​a graph where all vertices are isolated

​Question:
Consider the network diagram below.
The vertices are labelled A, B, C, D, E, F, G.

Edges are drawn as shown:
A is connected to B, C, D.
B is connected to A, C.
C is connected to A, B, D, E.
D is connected to A, C and has a loop
E is connected to C, F. F is connected to E. G has no edges.

sum of the degrees = 2 x number of edges

adding up all of the degrees in a network

​For example:

22 degrees
and ... 11 edges

​VERTEX

Odd: a vertex that has an odd number for the degree

Evan: a vertex that has an even number for the degree

​Your text here isometric (SAME) if you move the vertices and edges without changing the number of vertices or edges and without changing which vertices the edges connect to.

Any graph that can be redrawn without overlapping lines.

v = vertex

f= faces

e = edges

A graph has the following vertices and edges:

• Vertices: A B C D E F

• Edges: (A,B),(A,C),(A,D),(A,E),(B,C),(C,D),(D,E),(E,F), (F,A)