Search Results for ""

A weighted adjacency matrix A_f of a simple graph is defined for a real positive symmetric function f(d_i,d_j) on the vertex degrees d_i of a graph as ...

The n-wheel complement graph W^__n is the graph complement of the n-wheel graph. For n>4, W^__n is isomorphic to the graph disjoint union of a circulant graph ...

The (m,n)-windmill graph is the graph obtained by taking m copies of the complete graph K_n with a vertex in common (Gallian 2011, p. 16). The (m,n)-windmill graph is ...

Let f be a real-valued, continuous, and strictly increasing function on [0,c] with c>0. If f(0)=0, a in [0,c], and b in [0,f(c)], then int_0^af(x)dx+int_0^bf^(-1)(x)dx>=ab, ...

The square of the area of the base (i.e., the face opposite the right trihedron) of a trirectangular tetrahedron is equal to the sum of the squares of the areas of its other ...

An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...

Given a real number q>1, the series x=sum_(n=0)^inftya_nq^(-n) is called the q-expansion, or beta-expansion (Parry 1957), of the positive real number x if, for all n>=0, ...

The free module of rank n over a nonzero unit ring R, usually denoted R^n, is the set of all sequences {a_1,a_2,...,a_n} that can be formed by picking n (not necessarily ...

The Montgomery-Odlyzko law (which is a law in the sense of empirical observation instead of through mathematical proof) states that the distribution of the spacing between ...

A number n is called an e-perfect number if sigma_e(n)=2n, where sigma_e(n) is the sum of the e-Divisors of n. If m is squarefree, then sigma_e(m)=m. As a result, if n is ...