Search Results for ""

A figurate number of the form P_n^((4))=1/6n(n+1)(2n+1), (1) corresponding to a configuration of points which form a square pyramid, is called a square pyramidal number (or ...

A noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

There are several sorts of graphs referred to as "star graphs" in mathematics, computer science, and information processing. The most common sort of star is the n-star graph ...

The regular tetrahedron, often simply called "the" tetrahedron, is the Platonic solid with four polyhedron vertices, six polyhedron edges, and four equivalent equilateral ...

The conjecture due to Pollock (1850) that every number is the sum of at most five tetrahedral numbers (Dickson 2005, p. 23; incorrectly described as "pyramidal numbers" and ...

A graph G is said to be locally X, where X is a graph (or class of graphs), when for every vertex v, the graph induced on G by the set of adjacent vertices of V (sometimes ...

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 circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

A figurate number which is given by Ptop_n=1/4Te_n(n+3)=1/(24)n(n+1)(n+2)(n+3), where Te_n is the nth tetrahedral number. The first few pentatope numbers are 1, 5, 15, 35, ...

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...