Graph details

Graph # 33972

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 0.559 Laplacian Largest Eigenvalue 15.167
Average Degree 11 Longest Induced Cycle 7
Bipartite No Longest Induced Path 11
Chromatic Index Computation time out Matching Number 18
Chromatic Number 7 Maximum Degree 11
Circumference Computation time out Minimum Degree 11
Claw-Free No Minimum Dominating Set 4
Clique Number 7 Number of Components 1
Connected Yes Number of Edges 198
Density 0.314 Number of Triangles 423
Diameter 4 Number of Vertices 36
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 2
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 10.441
Hamiltonian Computation time out Smallest Eigenvalue -4.167
Independence Number 8 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.