Graph details

Graph # 33992

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 4
Algebraic Connectivity 1.203 Laplacian Largest Eigenvalue 7.19
Average Degree 4 Longest Induced Cycle 13
Bipartite No Longest Induced Path 12
Chromatic Index 5 Matching Number 10
Chromatic Number 3 Maximum Degree 4
Circumference 21 Minimum Degree 4
Claw-Free No Minimum Dominating Set 5
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 42
Density 0.2 Number of Triangles 6
Diameter 4 Number of Vertices 21
Edge Connectivity 4 Planar No
Eulerian Yes Radius 3
Genus 3 Regular Yes
Girth 3 Second Largest Eigenvalue 2.797
Hamiltonian Yes Smallest Eigenvalue -3.19
Independence Number 8 Vertex Connectivity 4

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 4-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.