Search Results for ""

A Fibonacci prime is a Fibonacci number F_n that is also a prime number. Every F_n that is prime must have a prime index n, with the exception of F_4=3. However, the converse ...

The flower snarks, denoted J_n for n=5, 7, 9, ..., are a family of graphs discovered by Isaacs (1975) which are snarks. The construction for flower snarks may be generalized ...

The Goddard-Henning graph, illustrated above in several embeddings, is the 9-node planar graph of graph diameter 2 having domination number gamma=3. It was first constructed ...

Chvátal defines the term hole to mean "a chordless cycle of length at least four." The restriction "of length at least four" allows use of the term "hole" regardless of if ...

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...

The Harary graph H_(k,n) is a particular example of a k-connected graph with n graph vertices having the smallest possible number of edges. The smallest number of edges ...

A holyhedron is polyhedron whose faces and holes are all finite-sided polygons and that contains at least one hole whose boundary shares no point with a face boundary. D. ...

A closed interval corresponding to a finite portion of an infinite line. Line segments are generally labeled with two letters corresponding to their endpoints, say A and B, ...

There are several different kinds of magic numbers. The digital root and magic constant are sometimes known as magic numbers. In baseball, the magic number for a team in ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...