Search Results for ""

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

A three-colorable graph G is a graph with chromatic number chi(G)<=3.

Critical damping is a special case of damped simple harmonic motion x^..+betax^.+omega_0^2x=0, (1) in which D=beta^2-4omega_0^2=0, (2) where beta is the damping constant. ...

Overdamped simple harmonic motion is a special case of damped simple harmonic motion x^..+betax^.+omega_0^2x=0, (1) in which beta^2-4omega_0^2>0. (2) Therefore ...

The square of a graph is defined as its second graph power. The square of any biconnected graph is Hamiltonian (Fleischner 1974, Skiena 1990, p. 231). Mukhopadhyay (1967) has ...

The order-n dipole graph D_n is a multigraph consisting of two vertices and n multiple edges joining them. The dipole graph D_2 is a multigraph that can be considered to ...

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...

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 ...

A simple root of a Lie algebra is a positive root that is not the sum of two positive roots.

Adding a damping force proportional to x^. to the equation of simple harmonic motion, the first derivative of x with respect to time, the equation of motion for damped simple ...