Search Results for ""
991 - 1000 of 2745 for Distance Regular GraphSearch Results
Let a set of vertices A in a connected graph G be called convex if for every two vertices x,y in A, the vertex set of every (x,y) graph geodesic lies completely in A. Also ...
At least one power series solution will be obtained when applying the Frobenius method if the expansion point is an ordinary, or regular, singular point. The number of roots ...
A hosohedron is a regular tiling or map on a sphere composed of p digons or spherical lunes, all with the same two vertices and the same vertex angles, 2pi/p. Its Schläfli ...
Let M subset R^3 be a regular surface and u_(p) a unit tangent vector to M, and let Pi(u_(p),N(p)) be the plane determined by u_(p) and the normal to the surface N(p). Then ...
A point p on a regular surface M in R^3 is said to be parabolic if the Gaussian curvature K(p)=0 but S(p)!=0 (where S is the shape operator), or equivalently, exactly one of ...
A point p on a regular surface M in R^3 is said to be planar if the Gaussian curvature K(p)=0 and S(p)=0 (where S is the shape operator), or equivalently, both of the ...
A topological space fulfilling the T3-separation axiom: X fulfils the T1-separation axiom and is regular. According to the terminology of Alexandroff and Hopf (1972), ...
Given a regular tetrahedron of unit volume, the mean triangle area of a triangle picked at random inside it is approximately A=0.1811+/-0.0012, and the variance is ...
For every topological T1-space X, the following conditions are equivalent. 1. X is regular and second countable, 2. X is separable and metrizable. 3. X is homeomorphic to a ...
The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...
...
View search results from all Wolfram sites (19754 matches)

