Search Results for ""
1111 - 1120 of 2400 for Uniqueness_theoremSearch Results
A Pisot number is a positive algebraic integer greater than 1 all of whose conjugate elements have absolute value less than 1. A real quadratic algebraic integer greater than ...
There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...
The triangular graph T_n=L(K_n) is the line graph of the complete graph K_n (Brualdi and Ryser 1991, p. 152). The vertices of T_n may be identified with the 2-subsets of ...
A method which can be used to solve some classes of integral equations and is especially useful in implementing certain types of data inversion. It has been applied to invert ...
Division by zero is the operation of taking the quotient of any number x and 0, i.e., x/0. The uniqueness of division breaks down when dividing by zero, since the product ...
The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...
The Leonard graph is a distance-regular graph on 288 vertices (Brouwer et al. 1989, p. 369) with intersection array {12,11,10,7;1,2,5,12}. It is however not ...
A Trott constant is a real number whose decimal digits are equal to the terms of its continued fraction. The first Trott constant (OEIS A039662) was discovered by M. Trott in ...
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, ...
An automorphic graph is a distance-transitive graph Gamma for which the automorphism group Aut(Gamma) acts primitively on the vertices of Gamma and is not a complete graph or ...
...
View search results from all Wolfram sites (6671 matches)

