Search Results for ""

Given a distance-regular graph G with integers b_i,c_i,i=0,...,d such that for any two vertices x,y in G at distance i=d(x,y), there are exactly c_i neighbors of y in ...

The intersection number omega(G) of a given graph G is the minimum number of elements in a set S such that G is an intersection graph on S.

An array A=a_(ij), i,j>=1 of positive integers is called an interspersion if 1. The rows of A comprise a partition of the positive integers, 2. Every row of A is an ...

An interval is a connected portion of the real line. If the endpoints a and b are finite and are included, the interval is called closed and is denoted [a,b]. If the ...

Interval arithmetic is the arithmetic of quantities that lie within specified ranges (i.e., intervals) instead of having definite known values. Interval arithmetic can be ...

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 partially ordered set P=(X,<=) is an interval order if it is isomorphic to some set of intervals on the real line ordered by left-to-right precedence. Formally, P is an ...

A point process N on R is said to be interval stationary if for every r=1,2,3,... and for all integers i_i,...,i_r, the joint distribution of {tau_(i_1+k),...,tau_(i_r+k)} ...

A curvature such as Gaussian curvature which is detectable to the "inhabitants" of a surface and not just outside observers. An extrinsic curvature, on the other hand, is not ...

The tangent space at a point p in an abstract manifold M can be described without the use of embeddings or coordinate charts. The elements of the tangent space are called ...