Search Results for ""

A graph G is Hamilton-connected if every two vertices of G are connected by a Hamiltonian path (Bondy and Murty 1976, p. 61). In other words, a graph is Hamilton-connected if ...

A connected bipartite graph is called Hamilton-laceable, a term apparently introduced in Simmons (1978), if it has a u-v Hamiltonian path for all pairs of vertices u and v, ...

A Hamiltonian graph, also called a Hamilton graph, is a graph possessing a Hamiltonian cycle. A graph that is not Hamiltonian is said to be nonhamiltonian. A Hamiltonian ...

The happy end problem, also called the "happy ending problem," is the problem of determining for n>=3 the smallest number of points g(n) in general position in the plane ...

Two graphs which contain the same number of graph vertices connected in the same way are said to be isomorphic. Formally, two graphs G and H with graph vertices ...

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 Koch snowflake is a fractal curve, also known as the Koch island, which was first described by Helge von Koch in 1904. It is built by starting with an equilateral ...

The least common multiple of two numbers a and b, variously denoted LCM(a,b) (this work; Zwillinger 1996, p. 91; Råde and Westergren 2004, p. 54), lcm(a,b) (Gellert et al. ...

The lemniscate, also called the lemniscate of Bernoulli, is a polar curve defined as the locus of points such that the the product of distances from two fixed points (-a,0) ...

A Lucas cube graph of order n is a graph that can be defined based on the n-Fibonacci cube graph by forbidding vertex strings that have a 1 both in the first and last ...