Search Results for ""

The hemicubical graph is the skeleton of the hemicube. It has 7 vertices, 11 edges, and 6 faces. It is implemented in the Wolfram Language as GraphData["HemicubicalGraph"].

A planar graph corresponding to polyhedra skeletons. The polyhedral graphs are special cases.

A graph G is k-factorable if it is the union of disjoint k-factors (Skiena 1990, p. 244).

There are a number of functions in various branches of mathematics known as Riemann functions. Examples include the Riemann P-series, Riemann-Siegel functions, Riemann theta ...

There are a number of functions in mathematics commonly denoted with a Greek letter lambda. Examples of one-variable functions denoted lambda(n) with a lower case lambda ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

The Doro graph is a distance-transitive and Distance-Regular Graph on 68 vertices and with valency 12. It is the unique automorphic graph having intersection array ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...

The McLaughlin graph is a 112-regular graph on 275 nodes and 15400 edges that can be constructed from the Witt design. It is distance-regular with intersection array ...

A function f(x) is said to be concave on an interval [a,b] if, for any points x_1 and x_2 in [a,b], the function -f(x) is convex on that interval (Gradshteyn and Ryzhik 2000).