An introduction to analytic graph theory
Abstract
Let S be a set of graphs or a set of objects associated with some specific graph such that there is a symmetric adjacency relation defined on S. Two elements S and Sl of S are connected in S if there exists a sequence S = S0, S1, S2,..., Sk = Sl of elements of S such that Si and Si+1 are adjacent for i = 0,1,...,k - 1. The minimum k for which such a sequence exists is the distance d(S, Sl) between S and Sl. If every pair of elements of S are connected, then S is connected. If S is connected, then (S, d) is a metric space. A nonnegative integer-valued function f defined on S is defined to be continuous on S if ∥f(S) - f(Sl)∥ ≤ 1 for every two adjacent elements S and Sl of S. We consider various functions, continuous and noncontinuous, defined on such metric spaces. For each such metric space (S,d), there is an associated metric graph whose vertices are the elements of the metric space and where two vertices of the metric graph are adjacent if and only if the corresponding elements are adjacent. These metric graphs are studied as well.
