Search Results for ""

The number of coincidences of a (nu,nu^') correspondence of value gamma on a curve of curve genus p is given by nu+nu^'+2pgamma.

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 ...

The cube of a graph is defined as its third graph power.

The cubic Archimedean graph on 60 nodes and 90 edges that is the skeleton of the truncated dodecahedron. It is implemented in the Wolfram Language as ...

The metric of Felix Klein's model for hyperbolic geometry, g_(11) = (a^2(1-x_2^2))/((1-x_1^2-x_2^2)^2) (1) g_(12) = (a^2x_1x_2)/((1-x_1^2-x_2^2)^2) (2) g_(22) = ...

A Berge graph is a simple graph that contains no odd graph hole and no odd graph antihole. The strong perfect graph theorem asserts that a graph is perfect iff it is a Berge ...

The Reye graph is the transposition graph G_4 of order 4.

A reflexive graph is a pseudograph such that each vertex has an associated graph loop.

The Pasch graph is the Levi graph of the Pasch configuration. The Pasch graph is edge-transitive but not vertex-transitive, but fails to be semisymmetric since it is not ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...