Search Results for ""
111 - 120 of 2082 for Path GraphSearch Results
View search results from all Wolfram sites (16803 matches)A shuffle-exchange graph is a nonsimple graph (due to the existence of graph loops) whose vertices are length n binary strings with an edge from w to w^' if 1. w^' differs ...
A graph cycle.
The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...
The skeleton of a trapezohedron may be termed a trapezohedral graph. n-trapezohedral graphs are illustrated above for n=3 to 10 in circular embeddings with the two interior ...
A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...
A white bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
The tetragonal antiwedge graph is the skeleton of the tetragonal antiwedge. It is a has 6 vertices, 10 edges, and 6 faces. The tetragonal antiwedge graph is self-dual and is ...
The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...
A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...
The rhombic triacontahedral graph is Archimedean dual graph which is the skeleton of the rhombic triacontahedron, great rhombic triacontahedron, and small triambic ...
...