Graph details

Graph # 33966

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

House of Graphs

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 11
Algebraic Connectivity 1.942 Laplacian Largest Eigenvalue 15.319
Average Degree 11 Longest Induced Cycle 9
Bipartite No Longest Induced Path 8
Chromatic Index Computation time out Matching Number 15
Chromatic Number 8 Maximum Degree 11
Circumference 30 Minimum Degree 11
Claw-Free No Minimum Dominating Set 3
Clique Number 8 Number of Components 1
Connected Yes Number of Edges 165
Density 0.379 Number of Triangles 335
Diameter 3 Number of Vertices 30
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 2
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 9.058
Hamiltonian Yes Smallest Eigenvalue -4.319
Independence Number 6 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 House of Graphs at Aug 9, 2019 11:53 AM.
An 11-regular nut graph. See "P.W. Fowler, J.B. Gauci, J. Goedgebeur, T. Pisanski and I. Sciriha, Existence of d-regular nut graphs for d at most 11, submitted" for more information.

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