Search Results for ""

A graph whose nodes are sequences of symbols from some alphabet and whose edges indicate the sequences which might overlap. The above figures show the first few n-dimensional ...

The van der Pol equation is an ordinary differential equation that can be derived from the Rayleigh differential equation by differentiating and setting y=y^'. It is an ...

A regular graph that is not strongly regular is known as a weakly regular graph. There are no weakly regular simple graphs on fewer than six nodes, and the numbers on n=6, 7, ...

A (v,g)-cage graph is a v-regular graph of girth g having the minimum possible number of nodes. When v is not explicitly stated, the term "g-cage" generally refers to a ...

A matchstick graph is a simple graph which has a graph embedding that is planar, for which all distances between vertices have unit distance, and which is non-degenerate (so ...

A tree is a mathematical structure that can be viewed as either a graph or as a data structure. The two views are equivalent, since a tree data structure contains not only a ...

A chordal graph is a simple graph in which every graph cycle of length four and greater has a cycle chord. In other words, a chordal graph is a graph possessing no chordless ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

There are no fewer than three distinct notions of curve throughout mathematics. In topology, a curve is a one-dimensional continuum (Charatonik and Prajs 2001). In algebraic ...

A Laman graph is a graph satisfying Laman's theorem. In other words, it is a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G and for which ...