Search Results for ""

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

The symbol ker has at least two different meanings in mathematics. It can refer to a special function related to Bessel functions, or (written either with a capital or ...

An n-tuple, sometimes simply called a "tuple" when the number n is known implicitly, is another word for a list, i.e., an ordered set of n elements. It can be interpreted as ...

The cube is the Platonic solid composed of six square faces that meet each other at right angles and has eight vertices and 12 edges. It is also the uniform polyhedron with ...

The divisor function sigma_k(n) for n an integer is defined as the sum of the kth powers of the (positive integer) divisors of n, sigma_k(n)=sum_(d|n)d^k. (1) It is ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

The n-centipede graph, n-centipede tree, n-comb graph (Seoud and Youssef 2017), or simply "n-centipede," is the tree on 2n nodes obtained by joining the bottoms of n copies ...

The self-intersection of a one-sided surface. The word "cross-cap" is sometimes also written without the hyphen as the single word "crosscap." The cross-cap can be thought of ...

Cubic graphs, also called trivalent graphs, are graphs all of whose nodes have degree 3 (i.e., 3-regular graphs). Cubic graphs on n nodes exists only for even n (Harary 1994, ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...