Search Results for ""
881 - 890 of 1530 for Complete Elliptic Integralofthe First Ki...Search Results
A lucky number of Euler is a number p such that the prime-generating polynomial n^2-n+p is prime for n=1, 2, ..., p-1. Such numbers are related to the imaginary quadratic ...
A problem is assigned to the NP (nondeterministic polynomial time) class if it is solvable in polynomial time by a nondeterministic Turing machine. A P-problem (whose ...
Let K be a field of arbitrary characteristic. Let v:K->R union {infty} be defined by the following properties: 1. v(x)=infty<=>x=0, 2. v(xy)=v(x)+v(y) forall x,y in K, and 3. ...
A nut graph is a graph on n>=2 vertices with adjacency matrix A such that A has matrix rank 1 and contains no 0 element (Sciriha 1998, 2008; Sciriha and Gutman, 1998; and ...
A finite simple connected graph G is quadratically embeddable if its quadratic embedding constant QEC(G) is nonpositive, i.e., QEC(G)<=0. A graph being quadratically ...
The singleton graph is the graph consisting of a single isolated node with no edges. It is therefore the empty graph on one node. It is commonly denoted K_1 (i.e., the ...
The n-sunlet graph is the graph on 2n vertices obtained by attaching n pendant edges to a cycle graph C_n (ISGCI), i.e., the coronas C_n circledot K_1 (Frucht 1979). Sunlet ...
A vector basis of a vector space V is defined as a subset v_1,...,v_n of vectors in V that are linearly independent and span V. Consequently, if (v_1,v_2,...,v_n) is a list ...
A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...
Analysis
...