Search Results for ""

A complete bipartite graph, sometimes also called a complete bicolored graph (Erdős et al. 1965) or complete bigraph, is a bipartite graph (i.e., a set of graph vertices ...

A complete graph is a graph in which each pair of graph vertices is connected by an edge. The complete graph with n graph vertices is denoted K_n and has (n; 2)=n(n-1)/2 (the ...

A planar polygon is convex if it contains all the line segments connecting any pair of its points. Thus, for example, a regular pentagon is convex (left figure), while an ...

Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take f(t) = F_nu^(-1)[F(nu)](t)=int_(-infty)^inftyF(nu)e^(2piinut)dnu (1) g(t) = ...

Geometric objects lying in a common plane are said to be coplanar. Three noncollinear points determine a plane and so are trivially coplanar. Four points are coplanar iff the ...

A cubic triangular number is a positive integer that is simultaneously cubic and triangular. Such a number must therefore satisfy T_n=m^3 for some positive integers n and m, ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

A cyclide is a pair of focal conics which are the envelopes of two one-parameter families of spheres, sometimes also called a cyclid. The cyclide is a quartic surface, and ...

A cylindric section is the intersection of a plane with a right circular cylinder. It is a circle (if the plane is at a right angle to the axis), an ellipse, or, if the plane ...

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 ...