Search Results for ""

There are several differing definitions of the sun graph. ISGCI defines a (complete) n-sun graph as a graph on 2n nodes (sometimes also known as a trampoline graph; ...

The Cameron graph is a strongly regular Hamiltonian graph on 231 vertices with parameters (nu,k,lambda,mu)=(231,30,9,3). It is distance-regular with intersection array ...

The Dejter graph is a weakly regular graph on 112 vertices and 336 edges with regular paremeters (nu,k,lambda,mu)=(112,6,0,(0,1,2)). It can be obtained by deleting a copy of ...

A connected graph is graph that is connected in the sense of a topological space, i.e., there is a path from any point to any other point in the graph. A graph that is not ...

A cycle of a graph G, also called a circuit if the first vertex is not specified, is a subset of the edge set of G that forms a path such that the first node of the path ...

The deltoidal hexecontahedral graph is an Archimedean dual graph which is the skeleton of the deltoidal hexecontahedron as well as the rhombic hexecontahedron. It is ...

The tetrakis hexahedral graph is Archimedean dual graph which is the skeleton of the disdyakis triacontahedron. It is implemented in the Wolfram Language as ...

The Fritsch graph is the 9-node planar graph illustrated above that tangles the Kempe chains in Kempe's algorithm and thus provides an example of how Kempe's supposed proof ...

The word "rigid" has two different meaning when applied to a graph. Firstly, a rigid graph may refer to a graph having a graph automorphism group containing a single element. ...

An edge-magic graph is a labeled graph with e graph edges labeled with distinct elements {1,2,...,e} so that the sum of the graph edge labels at each graph vertex is the ...