Search Results for ""

A number of attractive tetrahedron 10-compounds can be constructed. The first (left figures) can be obtained by combining tetrahedron 5-compounds of opposite chirality ...

The 13 Archimedean solids are the convex polyhedra that have a similar arrangement of nonintersecting regular convex polygons of two or more different types arranged in the ...

An n-gonal pyramid adjoined to the top of an n-gonal antiprism. In the 3-gonal gyroelongated pyramid, the pyramid and lateral antiprism are coplanar. However, the 4-gonal and ...

A graceful labeling (or graceful numbering) is a special graph labeling of a graph on m edges in which the nodes are labeled with a subset of distinct nonnegative integers ...

The (upper) vertex independence number of a graph, often called simply "the" independence number, is the cardinality of the largest independent vertex set, i.e., the size of ...

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

LCF notation is a concise and convenient notation devised by Joshua Lederberg (winner of the 1958 Nobel Prize in Physiology and Medicine) for the representation of cubic ...

The pentagrammic antiprism is the uniform polyhedron with Maeder index 79 (Maeder 1997), Coxeter index 34 (Coxeter et al. 1954), and Har'El index 4 (Har'El 1993). It will be ...

A k-regular simple graph G on nu nodes is strongly k-regular if there exist positive integers k, lambda, and mu such that every vertex has k neighbors (i.e., the graph is a ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...