Search Results for ""

A spanning tree of a graph on n vertices is a subset of n-1 edges that form a tree (Skiena 1990, p. 227). For example, the spanning trees of the cycle graph C_4, diamond ...

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

An additive category is a category for which the morphism sets have the structure of Abelian groups. It satisfies some, but not all the properties of an Abelian category.

An antilinear operator A^~ satisfies the following two properties: A^~[f_1(x)+f_2(x)] = A^~f_1(x)+A^~f_2(x) (1) A^~cf(x) = c^_A^~f(x), (2) where c^_ is the complex conjugate ...

The Bellman-Ford algorithm is an algorithm for solving the shortest path problem, i.e., finding a graph geodesic between two given vertices. Other algorithms that can be used ...

The study of the nature and properties of bifurcations.

Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.

The Dutch windmill graph D_3^((m)), also called a friendship graph, is the graph obtained by taking m copies of the cycle graph C_3 with a vertex in common (Gallian 2007), ...

The French metro metric is an example for disproving apparently intuitive but false properties of metric spaces. The metric consists of a distance function on the plane such ...

The Goldberg graphs are a family of graphs discovered by Goldberg (1981) which are snarks for n=5, 7, 9, .... Precomputed properties of Goldberg graphs are implemented in the ...