Search Results for ""

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

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

The Laplacian spectral radius of a finite graph is defined as the largest value of its Laplacian spectrum, i.e., the largest eigenvalue of the Laplacian matrix (Lin et al. ...

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

Let f be a fractional coloring of a graph G. Then the sum of values of f is called its weight, and the minimum possible weight of a fractional coloring is called the ...

Two sets A and B are said to be independent if their intersection A intersection B=emptyset, where emptyset is the empty set. For example, {A,B,C} and {D,E} are independent, ...

The second Mersenne prime M_3=2^3-1, which is itself the exponent of Mersenne prime M_7=2^7-1=127. It gives rise to the perfect number P_7=M_7·2^6=8128. It is a Gaussian ...

Given a regular surface M, an asymptotic curve is formally defined as a curve x(t) on M such that the normal curvature is 0 in the direction x^'(t) for all t in the domain of ...

The numbers three and four appear prominently in the game of baseball. There are three strikes for an out, three outs per half-inning (i.e., teams switch after three outs, ...

The second-order ordinary differential equation xy^('')+(c-x)y^'-ay=0, sometimes also called Kummer's differential equation (Slater 1960, p. 2; Zwillinger 1997, p. 124). It ...