Search Results for ""

A polyhedral graph corresponding to the skeleton of a Platonic solid. The five platonic graphs, the tetrahedral graph, cubical graph, octahedral graph, dodecahedral graph, ...

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 Grassmann graph J_q(n,k) is defined such that the vertices are the k-dimensional subspaces of an n-dimensional finite field of order q and edges correspond to pairs of ...

The Kummer graph is the name apparently first adopted here for the Levi graph of Kummer's 16_6 configuration (Coxeter 1950), corresponding to the folded 6-cube graph (Brouwer ...

The depth of a vertex v in a rooted tree as the number of edges from v to the root vertex. A function to return the depth of a vertex v in a tree g may be implemented in a ...

The Zara graph is the unique graph on 126 vertices satisfying the properties that 1) every maximal clique (of which there are a total of 567) has six vertices, and 2) that if ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...

The n-crown graph for an integer n>=3 is the graph with vertex set {x_0,x_1,...,x_(n-1),y_0,y_1,...,y_(n-1)} (1) and edge set {(x_i,y_j):0<=i,j<=n-1,i!=j}. (2) It is ...

The truncated octahedral graph is the cubic Archimedean graph on 24 nodes and 36 edges that is the skeleton of the truncated octahedron. It is isomorphic to the Bruhat graph ...