Graph details

Graph # 33976

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 3
Algebraic Connectivity 0.764 Laplacian Largest Eigenvalue 5.534
Average Degree 3 Longest Induced Cycle 13
Bipartite No Longest Induced Path 13
Chromatic Index 3 Matching Number 10
Chromatic Number 3 Maximum Degree 3
Circumference 20 Minimum Degree 3
Claw-Free No Minimum Dominating Set 6
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 30
Density 0.158 Number of Triangles 0
Diameter 4 Number of Vertices 20
Edge Connectivity 3 Planar No
Eulerian No Radius 4
Genus 2 Regular Yes
Girth 5 Second Largest Eigenvalue 2.236
Hamiltonian Yes Smallest Eigenvalue -2.534
Independence Number 8 Vertex Connectivity 3

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 26, 2019 12:34 PM.
A 3-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.