Search Results for ""

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 icositetrahedral graph is Archimedean dual graph which is the skeleton of the deltoidal icositetrahedron. It is implemented in the Wolfram Language as ...

The Hall graph is a distance-transitive graph on 65 vertices having intersection array {10,6,4,1;1,2,5} (Hall 1980). It is denoted Gamma^((3)) by Hall (1980) and was ...

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

The triakis tetrahedral graph is Archimedean dual graph which is the skeleton of the triakis tetrahedron. It is implemented in the Wolfram Language as ...

A two-dimensional grid graph, also known as a rectangular grid graph or two-dimensional lattice graph (e.g., Acharya and Gill 1981), is an m×n lattice graph that is the graph ...

The Robertson graph is the unique (4,5)-cage graph, illustrated above. It has 19 vertices and 38 edges. It has girth 5, diameter 3, chromatic number 3, and is a quartic ...

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

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

The kth power of a graph G is a graph with the same set of vertices as G and an edge between two vertices iff there is a path of length at most k between them (Skiena 1990, ...