Search Results for ""
1421 - 1430 of 2001 for Dominating Unique GraphsSearch Results

The Zolotarev-Schur constant is given by sigma = 1/(c^2)[1-(E(c))/(K(c))]^2 (1) = 0.3110788667048... (2) (OEIS A143295), where K(c) is a complete elliptic integral of the ...
Linear Algebra
The h-statistic h_r is the unique symmetric unbiased estimator for a central moment of a distribution <h_r>=mu_r. (1) In addition, the variance var(h_r)=<(h_r-mu_r)^2> (2) is ...
Any nonzero rational number x can be represented by x=(p^ar)/s, (1) where p is a prime number, r and s are integers not divisible by p, and a is a unique integer. The p-adic ...
The characteristic polynomial is the polynomial left-hand side of the characteristic equation det(A-lambdaI)=0, (1) where A is a square matrix and I is the identity matrix of ...
Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.
A binary relation associated with an instance of the stable marriage problem. Stable marriages correspond to vertices with outdegree 0 in the divorce digraph (Skiena 1990, p. ...
The mathematical study of the properties of the formal mathematical structures called graphs.
A near-perfect matching is a matching in which a single vertex is left unmatched. Just as perfect matchings can occur only for graphs with an even number of vertices, ...
A pentahedron is polyhedron having five faces. Because there are two pentahedral graphs, there are two convex pentahedra, corresponding to the topologies of the square ...

...