## Adjacency matrix[Too large to display] |
## Adjacency list[Too large to display] |

1340

Tesseract Graph

MathWorld

Invariant | Value | Invariant | Value |
---|---|---|---|

Acyclic | No | Index | 4 |

Algebraic Connectivity | 2 | Laplacian Largest Eigenvalue | 8 |

Average Degree | 4 | Longest Induced Cycle | 8 |

Bipartite | Yes | Longest Induced Path | 7 |

Chromatic Index | 4 | Matching Number | 8 |

Chromatic Number | 2 | Maximum Degree | 4 |

Circumference | 16 | Minimum Degree | 4 |

Claw-Free | No | Minimum Dominating Set | 4 |

Clique Number | 2 | Number of Components | 1 |

Connected | Yes | Number of Edges | 32 |

Density | 0.267 | Number of Triangles | 0 |

Diameter | 4 | Number of Vertices | 16 |

Edge Connectivity | 4 | Planar | No |

Eulerian | Yes | Radius | 4 |

Genus | 1 | Regular | Yes |

Girth | 4 | Second Largest Eigenvalue | 2 |

Hamiltonian | Yes | Smallest Eigenvalue | -4 |

Independence Number | 8 | Vertex Connectivity | 4 |

A table row rendered like this
indicates that the graph is marked as being *interesting* for that invariant.

Posted by MathWorld at Mar 28, 2012 11:58 AM.

Source: MathWorld and GraphData in Mathematica.

Posted by Kevin Ryde at Oct 7, 2017 3:59 AM.

Knight Grid 4x4 cyclic. Each vertex is a square of a 4x4 chess board. Edges are moves a knight can make with wrap-around from one side of the board to the opposite side.

You need to be logged in to be able to add comments.