Graph details

Graph # 49239

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Folded Hypercube 7

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 7
Algebraic Connectivity 4 Laplacian Largest Eigenvalue 12
Average Degree 7 Longest Induced Cycle Computation time out
Bipartite No Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 32
Chromatic Number Computation time out Maximum Degree 7
Circumference 64 Minimum Degree 7
Claw-Free No Minimum Dominating Set 8
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 224
Density 0.111 Number of Triangles 0
Diameter 3 Number of Vertices 64
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 3
Genus Computation time out Regular Yes
Girth 4 Second Largest Eigenvalue 3
Hamiltonian Yes Smallest Eigenvalue -5
Independence Number 22 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:32 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.