Search Results for ""

The Sierpiński gasket graph of order n is the graph obtained from the connectivity of the Sierpiński sieve. The first few Sierpiński gasket graphs are illustrated above. S_2 ...

A double integral over three coordinates giving the area within some region R, A=intint_(R)dxdy. If a plane curve is given by y=f(x), then the area between the curve and the ...

A triple integral is a three-fold multiple integral of the form intintintf(x,y,z)dxdydz. Triple integrals arise in evaluating quantities such as the mass, volume, moment, ...

A triple integral over three coordinates giving the volume within some region G, V=intintint_(G)dxdydz.

The Heawood four-color graph is the 25-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's ...

The cubitruncated cuboctahedral graph is the skeleton of the cubitruncated cuboctahedron, which is the only uniform polyhedron for which this is the case. It is illustrated ...

The 13 Archimedean dual graphs are the skeletons of the Archimedean dual solids, illustrated above. Since they are polyhedral graphs, they are also planar. However, none of ...

Bouwer graphs, a term coined here for the first time, are a family of regular graphs which includes members that are symmetric but not arc-transitive. Such graphs are termed ...

A noneulerian graph is a graph that is not Eulerian. The numbers of simple noneulerian graphs on n=1, 2, ... nodes are 2, 3, 10, 30, 148, 1007, 12162, 272886, ... (OEIS ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...