Search Results for ""

The Balaban index J is a graph index defined for a graph on n nodes, m edges, and c connected components by J=m/(gamma+1)sum_((i,j) in E(G))(D_iD_j)^(-1/2), where gamma=m-n+c ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

The study of efficient algorithms for solving geometric problems. Examples of problems treated by computational geometry include determination of the convex hull and Voronoi ...

While many computations admit shortcuts that allow them to be performed more rapidly, others cannot be sped up. Computations that cannot be sped up by means of any shortcut ...

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

An Eulerian cycle, also called an Eulerian circuit, Euler circuit, Eulerian tour, or Euler tour, is a trail which starts and ends at the same graph vertex. In other words, it ...

If n>1 and n|1^(n-1)+2^(n-1)+...+(n-1)^(n-1)+1, is n necessarily a prime? In other words, defining s_n=sum_(k=1)^(n-1)k^(n-1), does there exist a composite n such that s_n=-1 ...

Let there be m doctors and n<=m patients, and let all mn possible combinations of examinations of patients by doctors take place. Then what is the minimum number of surgical ...

A Hamiltonian cycle, also called a Hamiltonian circuit, Hamilton cycle, or Hamilton circuit, is a graph cycle (i.e., closed loop) through a graph that visits each node ...

The computation of points or values between ones that are known or tabulated using the surrounding points or values. In particular, given a univariate function f=f(x), ...