TOPICS
Search

Search Results for ""


2001 - 2010 of 2903 for Minimum Total Dominating SetSearch Results
The apeirogon is an extension of the definition of regular polygon to a figure with an infinite number of sides. Its Schläfli symbol is {infty}. The apeirogon can produce a ...
Bonato et al. (2014, 2015) defined the burning number of a simple graph as follows. Consider a process called burning involving are discrete time steps. Each node is either ...
n Sloane's 2^n 3^n 4^n 5^n 6^n 7^n 8^n 9^n 1 A000027 2 3 4 5 6 7 8 9 2 A002993 4 9 1 2 3 4 6 8 3 A002994 8 2 6 1 2 3 5 7 4 A097408 1 8 2 6 1 2 4 6 5 A097409 3 2 1 3 7 1 3 5 6 ...
There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...
The (circular) helicoid is the minimal surface having a (circular) helix as its boundary. It is the only ruled minimal surface other than the plane (Catalan 1842, do Carmo ...
The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...
What space-filling arrangement of similar cells of equal volume has minimal surface area? This questions arises naturally in the theory of foams when the liquid content is ...
The Knödel graph W_(Delta,n) is a regular bipartite graph of vertex degree Delta on n nodes for even n>=2 and 1<=Delta<=|_log_2n_| with edges defined as follows. Label the ...
Let z=re^(itheta)=x+iy be a complex number, then inequality |(zexp(sqrt(1-z^2)))/(1+sqrt(1-z^2))|<=1 (1) holds in the lens-shaped region illustrated above. Written explicitly ...
Let f(z) be an entire function such that f(n) is an integer for each positive integer n. Then Pólya (1915) showed that if lim sup_(r->infty)(lnM_r)/r<ln2=0.693... (1) (OEIS ...
1 ... 198|199|200|201|202|203|204 ... 291 Previous Next

...