TOPICS
Search

Search Results for ""


1481 - 1490 of 2001 for Dominating Unique GraphsSearch Results
A rational amicable pair consists of two integers a and b for which the divisor functions are equal and are of the form sigma(a)=sigma(b)=(P(a,b))/(Q(a,b))=R(a,b), (1) where ...
The second Brocard point is the interior point Omega^' (also denoted tau_2 or Z_2) of a triangle DeltaABC with points labeled in counterclockwise order for which the angles ...
Stanley's theorem states that the total number of 1s that occur among all unordered partitions of a positive integer is equal to the sum of the numbers of distinct members of ...
The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...
The Thomson problem is to determine the stable equilibrium positions of n classical electrons constrained to move on the surface of a sphere and repelling each other by an ...
A series-reduced tree is a tree in which all nodes have degree other than 2 (in other words, no node merely allows a single edge to "pass through"). Series-reduced trees are ...
The Riemann zeta function is an extremely important special function of mathematics and physics that arises in definite integration and is intimately related with very deep ...
A coloring of plane regions, link segments, etc., is an assignment of a distinct labeling (which could be a number, letter, color, etc.) to each component. Coloring problems ...
A topological space decomposes into its connected components. The connectedness relation between two pairs of points satisfies transitivity, i.e., if a∼b and b∼c then a∼c. ...
An unlabeled transitive digraph with n nodes is called a "topology." The numbers of distinct topologies on n=1, 2, ... nodes are 1, 3, 9, 33, 139, 718, 4535, ... (OEIS ...
1 ... 146|147|148|149|150|151|152 ... 201 Previous Next

...