Search Results for ""

A Mongolian tent graph is defined as the graph obtained from the grid graph P_m square P_n for odd n by adding an extra vertex above the graph and joining every other vertex ...

A connected graph G is said to be t-tough if, for every integer k>1, G cannot be split into k different connected components by the removal of fewer than tk vertices. The ...

A number theoretic function is a function whose domain is the set of positive integers.

A function f(x) is said to be strictly decreasing on an interval I if f(b)<f(a) for all b>a, where a,b in I. On the other hand, if f(b)<=f(a) for all b>a, the function is ...

A function f(x) is said to be strictly increasing on an interval I if f(b)>f(a) for all b>a, where a,b in I. On the other hand, if f(b)>=f(a) for all b>a, the function is ...

A function whose value decreases more quickly than any polynomial is said to be an exponentially decreasing function. The prototypical example is the function e^(-x), plotted ...

A function whose value increases more quickly than any polynomial is said to be an exponentially increasing function. The prototypical example is the function e^x, plotted ...

A special function which is given by the logarithmic derivative of the gamma function (or, depending on the definition, the logarithmic derivative of the factorial). Because ...

The function [x] which gives the smallest integer >=x, shown as the thick curve in the above plot. Schroeder (1991) calls the ceiling function symbols the "gallows" because ...

A graph is strongly perfect if every induced subgraph H has an independent vertex set meeting all maximal cliques of H (Berge and Duchet 1984, Ravindra 1999). Every strongly ...