Search Results for ""

A matching, also called an independent edge set, on a graph G is a set of edges of G such that no two sets share a vertex in common. It is not possible for a matching on a ...

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

Geometry

The term "God's number" is sometimes given to the graph diameter of Rubik's graph, which is the minimum number of turns required to solve a Rubik's cube from an arbitrary ...

The global clustering coefficient C of a graph G is the ratio of the number of closed trails of length 3 to the number of paths of length two in G. Let A be the adjacency ...

An ordinary differential equation of the form y^('')+P(x)y^'+Q(x)y=0. (1) Such an equation has singularities for finite x=x_0 under the following conditions: (a) If either ...

A minimal edge cover is an edge cover of a graph that is not a proper subset of any other edge cover. Every minimum edge cover is a minimal edge cover, but the converse does ...

An algebra <L; ^ , v > is called a lattice if L is a nonempty set, ^ and v are binary operations on L, both ^ and v are idempotent, commutative, and associative, and they ...

There are several regular mathematics competitions available to students. The International Mathematical Olympiad is perhaps the largest, while the William Lowell Putnam ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...