Search Results for ""

Koh et al. (1980) and Gallian (2007) define a web graph as a stacked prism graph Y_(n+1,3) with the edges of the outer cycle removed. Web graphs are graceful. Precomputed ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

Integrals over the unit square arising in geometric probability are int_0^1int_0^1sqrt(x^2+y^2)dxdy=1/3[sqrt(2)+sinh^(-1)(1)] int_0^1int_0^1sqrt((x-1/2)^2+(y-1/2)^2)dxdy ...

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...

The moth graph is the 6-vertex graph illustrated above. It is implemented in the Wolfram Language as GraphData["MothGraph"].

A directed strongly regular graph is a simple directed graph with adjacency matrix A such that the span of A, the identity matrix I, and the unit matrix J is closed under ...

The integral of 1/r over the unit disk U is given by intint_(U)(dA)/r = intint_(U)(dxdy)/(sqrt(x^2+y^2)) (1) = int_0^(2pi)int_0^1(rdrdtheta)/r (2) = 2piint_0^1dr (3) = 2pi. ...

The Desargues graph is the cubic symmetric graph on 20 vertices and 30 edges illustrated above in several embeddings. It is isomorphic to the generalized Petersen graph ...

Given any tree T having v vertices of vertex degrees of 1 and 3 only, form an n-expansion by taking n disjoint copies of T and joining corresponding leaves by an n-cycle ...