Search Results for ""

The cubical graph is the Platonic graph corresponding to the connectivity of the cube. It is isomorphic to the generalized Petersen graph GP(4,1), bipartite Kneser graph ...

A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...

A random partition of a number n is one of the P(n) possible partitions of n, where P(n) is the partition function P. A random partition can be given by RandomPartition[n] in ...

A Young tableau chosen at random from those having a given shape. A random tableau can be generated by RandomTableau[shape] in the Wolfram Language package Combinatorica` . ...

A stack is a data structure which is a special kind of list in which elements may be added to or removed from the top only. These actions are called a push or a pop, ...

A quartic symmetric graph is a symmetric graph that is also quartic (i.e., regular of degree 4). The numbers of symmetric quartic graphs on n=1, 2, ... are 0, 0, 0, 0, 1, 1, ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

The 10_3 configuration of ten lines intersecting three at a time in 10 points which arises in Desargues' theorem. Its Levi graph is the Desargues graph.

A nonreflexible regular map of genus 7 with eight graph vertices, 28 graph edges, and eight heptagonal faces.

Das (2018) defines the triameter of a connected graph G with vertex set V and vertex count at least 3 as tr(G)=max{d(u,v)+d(v,w)+d(u,w):u,v,w in V}, where d(i,j) is the graph ...