Search Results for ""

There are a number of graphs associated with T. I. (and C. T.) Zamfirescu. The Zamfirescu graphs on 36 and 75 vertices, the former of which is a snark, appear in Zamfirescu ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

A ring in the mathematical sense is a set S together with two binary operators + and * (commonly interpreted as addition and multiplication, respectively) satisfying the ...

An nth-rank tensor in m-dimensional space is a mathematical object that has n indices and m^n components and obeys certain transformation rules. Each index of a tensor ranges ...

The Alexander polynomial is a knot invariant discovered in 1923 by J. W. Alexander (Alexander 1928). The Alexander polynomial remained the only known knot polynomial until ...

The Balaban 10-cage is one of the three (3,10)-cage graphs (Read and Wilson 1998, p. 272). The Balaban (3,10)-cage was the first known example of a 10-cage (Balaban 1973, ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

The Barnette-Bosák-Lederberg graph is a graph on 38 vertices which is the smallest known example of a planar 3-connected nonhamiltonian graph, i.e., the smallest known ...

The first (called the "Blanuša double" by Orbanić et al. 2004) and second (called the "Blanuša snark" by Orbanić et al. 2004) Blanuša snarks were the second and third snarks ...

Bowling, known as "ten pins" throughout most of the world, is a game played by rolling a heavy ball down a long narrow track and attempting to knock down ten pins arranged in ...