Search Results for ""

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 ...

A triangle line lalpha+mbeta+ngamma=0 defined relative to a reference triangle is called a central line iff l:m:n is a triangle center (Kimberling 1998, p. 127). If l:m:n is ...

There are four strongly regular graphs with parameters (nu,k,lambda,mu)=(28,12,6,4), one of them being the triangular graph of order 8. The other three such graphs are known ...

A modified set of Chebyshev polynomials defined by a slightly different generating function. They arise in the development of four-dimensional spherical harmonics in angular ...

A graph is claw-free iff it does not contain the complete bipartite graph K_(1,3) (known as the "claw graph"; illustrated above) as a forbidden induced subgraph. The line ...

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

There are three types of cubic lattices corresponding to three types of cubic close packing, as summarized in the following table. Now that the Kepler conjecture has been ...

A cubic semisymmetric graph is a graph that is both cubic (i.e., regular of degree 3) and semisymmetric (i.e., edge- but not vertex-transitive). The four smallest cubic ...

A cyclic quadrilateral is a quadrilateral for which a circle can be circumscribed so that it touches each polygon vertex. A quadrilateral that can be both inscribed and ...

The dodecicosahedral graph is the skeleton graph of the great ditrigonal dodecicosidodecahedron, great dodecicosahedron, great icosicosidodecahedron, small ditrigonal ...