Search Results for ""
11 - 20 of 2245 for Triangular Honeycomb Obstue Knight GraphSearch Results
View search results from all Wolfram sites (13790 matches)The triangle graph is the cycle graph C_3, which is isomorphic to the complete graph K_3 as well as to the complete tripartite graph K_(3×1)=K_(1,1,1) and the triangular ...
The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...
The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...
The Heawood graph is a cubic graph on 14 vertices and 21 edges which is the unique (3,6)-cage graph. It is also a Moore graph. It has graph diameter 3, graph radius 3, and ...
The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...
An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...
Cubic symmetric graphs are sometimes called Foster graphs and denoted F_(nnn)X, where nnn is the vertex count and X is a letter A, B, C, ... indicating the particular such ...
A camel graph is a graph formed by all possible moves of a hypothetical chess piece called a "camel" which moves analogously to a knight except that it is restricted to moves ...
A giraffe graph is a graph formed by all possible moves of a hypothetical chess piece called a "giraffe" which moves analogously to a knight except that it is restricted to ...
A fiveleaper graph is a graph formed by all possible moves of a hypothetical chess piece called a "fiveleaper" which moves analogously to a knight except that it is ...
...