Search Results for ""

A cubic symmetric graph is a symmetric cubic (i.e., regular of order 3). Such graphs were first studied by Foster (1932). They have since been the subject of much interest ...

The Janko-Kharaghani-Tonchev graph is a strongly regular graph on 324 vertices and 24786 edges. It has regular parameters (nu,k,lambda,mu)=(324,153,72,72). It is implemented ...

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

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...

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 Wolfram Physics Project posits the existence of abstract relations between atoms of space whose pattern defines the structure of physical space. In this approach, two ...

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

For a connected bipartite graph G, the halved graph G^+ and G^- are the two connected components of the distance 2-graph of G. The following table summarizes some named ...

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