Search Results for ""

A cubic vertex-transitive graph is a cubic graph that is vertex transitive. Read and Wilson (1998, pp. 161-163) enumerate all connected cubic vertex-transitive graphs on 34 ...

The smallest cubic graphs with graph crossing number CN(G)=n have been termed "crossing number graphs" or n-crossing graphs by Pegg and Exoo (2009). The n-crossing graphs are ...

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A column-convex self-avoiding polygon which contains the bottom edge of its minimal bounding rectangle. The anisotropic perimeter and area generating function ...

Consider the plane figure obtained by drawing each diagonal in a regular polygon with n vertices. If each point of intersection is associated with a node and diagonals are ...

Combinatorial geometry is a blending of principles from the areas of combinatorics and geometry. It deals with combinations and arrangements of geometric objects and with ...

The mathematical study of the properties of the formal mathematical structures called graphs.

The multiplicity of a multigraph is its maximum edge multiplicity.

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...