Search Results for ""

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...

The treewidth is a measure of the count of original graph vertices mapped onto any tree vertex in an optimal tree decomposition. Determining the treewidth of an arbitrary ...

The most general forced form of the Duffing equation is x^..+deltax^.+(betax^3+/-omega_0^2x)=gammacos(omegat+phi). (1) Depending on the parameters chosen, the equation can ...

The Lyapunov characteristic exponent [LCE] gives the rate of exponential divergence from perturbed initial conditions. To examine the behavior of an orbit around a point ...

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

A minimal dominating set is a dominating set in a graph that is not a proper subset of any other dominating set. Every minimum dominating set is a minimal dominating set, but ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...