Graph details

Graph # 49241

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Folded Hypercube 8

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index undefined
Algebraic Connectivity 4 Laplacian Largest Eigenvalue 16
Average Degree 8 Longest Induced Cycle Computation time out
Bipartite Yes Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 64
Chromatic Number 2 Maximum Degree 8
Circumference Computation time out Minimum Degree 8
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 512
Density 0.063 Number of Triangles 0
Diameter 4 Number of Vertices 128
Edge Connectivity Computation time out Planar Computation time out
Eulerian Yes Radius 4
Genus Computation time out Regular Yes
Girth 4 Second Largest Eigenvalue undefined
Hamiltonian Computation time out Smallest Eigenvalue undefined
Independence Number 64 Vertex Connectivity Computation time out

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


Posted by Kevin Ryde at Jul 21, 2022 6:36 AM.
A folded hypercube N is a hypercube N in which pairs of antipodal vertices are merged. The result is an N-1 hypercube with additional edges between each antipodal pair in that N-1.

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