Search Results for ""
851 - 860 of 2691 for Star of David theoremSearch Results
Let A be a closed convex subset of a Banach space and assume there exists a continuous map T sending A to a countably compact subset T(A) of A. Then T has fixed points.
Let all of the functions f_n(z)=sum_(k=0)^inftya_k^((n))(z-z_0)^k (1) with n=0, 1, 2, ..., be regular at least for |z-z_0|<r, and let F(z) = sum_(n=0)^(infty)f_n(z) (2) = (3) ...
An (n,k)-banana tree, as defined by Chen et al. (1997), is a graph obtained by connecting one leaf of each of n copies of an k-star graph with a single root vertex that is ...
The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...
A graph G=(V,E) is an interval graph if it captures the intersection relation for some set of intervals on the real line. Formally, P is an interval graph provided that one ...
A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...
As proved by Sierpiński (1960), there exist infinitely many positive odd numbers k such that k·2^n+1 is composite for every n>=1. Numbers k with this property are called ...
Multivariable calculus is the branch of calculus that studies functions of more than one variable. Partial derivatives and multiple integrals are the generalizations of ...
Let f be a finite real-valued function defined on an interval [a,b]. Then at every point in [a,b] except on a set of Lebesgue measure zero, either: 1. There is a finite ...
Two nonisomorphic graphs can share the same graph spectrum, i.e., have the same eigenvalues of their adjacency matrices. Such graphs are called cospectral. For example, the ...
...
View search results from all Wolfram sites (50883 matches)

