Graph Theory

Destinations with their connecting links

problems questioning routes and backtracking

the study of circuit and routing problems

collection of one or more points(vertices) and the connections between them(edges)

connections on a graph

Connection on a graph {singular}

connections on a graph eithier straight or curved

edge that connec ts to itself with only one vertex

two vertices ina graph connected by an edge

True

Total number of edges at a vertex

Count the number or segments or arches "coming out" of the vertex

route that passes from one vertex to an adjacent vertex, and each edge connecting an adjacent vertex is used, at most, once

path that uses every edge of a graph exactly once

path that ends at the same vertex in which it started

circuit that uses every edge of a graph exactly once

graph in which you can travel from any vertice to any other in the graph

a graph in which is not connected

seperate pieces of a graph that cannot be enlarged while remaining connected

edge in a connected graph, in which the removal of would leave behind a graph that is disconnected

gives optimal eulerization for a rectangular path

d=2e

more than one edge connecting two vertice

Is a simple way to make a circuit, rather than using Fleury's Algorithm