Glossary

 ARC DEGREE OF A VERTEX DEGREE OF A GRAPH EDGE EULER CIRCUIT EULER PATH GRAPH NETWORK NODE TRAVERSABLE VERTEX END OF PAGE

Arc: a path from one point (node) of a network to
another point (its endpoint or vertices)

Degree of a vertex:  a non-negative number which
indicates the number of lines (arcs or edges) that
enter the vertex. This is easily seen if you draw
a circle around the vertex and count the number of
edges which enter the circle.

Degree of a graph: the total number of degrees
of the vertices

Edge: another name for a line (also the same as an arc)

Euler circuit: a graph in which you can trace all of
the edges exactly once without picking up your
pencil. You also must start and end at the same
point.

Euler path: a graph in which you can trace all of the
edges exactly one without pickin up your pencil.
This is the same as a graph being travesable.

Graph: a picture made up of vertices and edges which
shows the relationship between the two

Network: a union of points and segments which connect
pairs of points together

Node: another name for a point or vertex

Traversable: a network in which all the arcs may be
traced exactly once without lifting the tracing
instrument

Vertex: a union of points. Also called a node
(the plural of vertex is vertices)

 Main Page Tutorial Activities Applications Bridge Problem Other Linls