Search Results for ""
5551 - 5560 of 9369 for Fermat 4n Plus 1 TheoremSearch Results
The Harries graph is one of the three (3,10)-cage graphs, the other two being the (10,3)-cage known as the Balaban 10-cage and the Harries-Wong graph. The Harries graph is ...
There are a number of point processes which are called Hawkes processes and while many of these notions are similar, some are rather different. There are also different ...
The Jack polynomials are a family of multivariate orthogonal polynomials dependent on a positive parameter alpha. Orthogonality of the Jack polynomials is proved in Macdonald ...
A Möbius ladder, sometimes called a Möbius wheel (Jakobson and Rivin 1999), of order n is a simple graph obtained by introducing a twist in a prism graph of order n that is ...
The n-pan graph is the graph obtained by joining a cycle graph C_n to a singleton graph K_1 with a bridge. The n-pan graph is therefore isomorphic with the (n,1)-tadpole ...
The star graph S_n of order n, sometimes simply known as an "n-star" (Harary 1994, pp. 17-18; Pemmaraju and Skiena 2003, p. 248; Tutte 2005, p. 23), is a tree on n nodes with ...
A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...
The number of equivalent hyperspheres in n dimensions which can touch an equivalent hypersphere without any intersections, also sometimes called the Newton number, contact ...
The term limit comes about relative to a number of topics from several different branches of mathematics. A sequence x_1,x_2,... of elements in a topological space X is said ...
A line is a straight one-dimensional figure having no thickness and extending infinitely in both directions. A line is sometimes called a straight line or, more archaically, ...
...
View search results from all Wolfram sites (505142 matches)

