Search Results for ""

The Weisfeiler-Leman dimension dim_(WL)(G) of a graph G, sometimes known as the WL dimension, is the smallest integer d such that the d-dimensional Weisfeiler-Leman algorithm ...

On July 10, 2003, Eric Weisstein computed the numbers of n×n (0,1)-matrices all of whose eigenvalues are real and positive, obtaining counts for n=1, 2, ... of 1, 3, 25, 543, ...

A triangle with side lengths a, b, and c and triangle area Delta satisfies a^2+b^2+c^2>=4sqrt(3)Delta. Equality holds iff the triangle is equilateral.

The apodization function A(x)=1-(x^2)/(a^2). (1) Its full width at half maximum is sqrt(2)a. Its instrument function is I(k) = 2asqrt(2pi)(J_(3/2)(2pika))/((2pika)^(3/2)) (2) ...

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

An expression is called "well-defined" (or "unambiguous") if its definition assigns it a unique interpretation or value. Otherwise, the expression is said to not be ...

A generalized hypergeometric function _pF_q[alpha_1,alpha_2,...,alpha_p; beta_1,beta_2,...,beta_q;z] is said to be well-poised if p=q+1 and ...

A totally ordered set (A,<=) is said to be well ordered (or have a well-founded order) iff every nonempty subset of A has a least element (Ciesielski 1997, p. 38; Moore 1982, ...

Every nonempty set of positive integers contains a smallest member.

The Wells graph, sometimes also called the Armanios-Wells graph, is a quintic graph on 32 nodes and 80 edges that is the unique distance-regular graph with intersection array ...