Graph details

Graph # 33978

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.159 Laplacian Largest Eigenvalue 5.645
Average Degree 3 Longest Induced Cycle 16
Bipartite No Longest Induced Path 15
Chromatic Index 3 Matching Number 11
Chromatic Number 3 Maximum Degree 3
Circumference 22 Minimum Degree 3
Claw-Free No Minimum Dominating Set 6
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 33
Density 0.143 Number of Triangles 6
Diameter 8 Number of Vertices 22
Edge Connectivity 2 Planar Yes
Eulerian No Radius 5
Genus 0 Regular Yes
Girth 3 Second Largest Eigenvalue 2.841
Hamiltonian Yes Smallest Eigenvalue -2.645
Independence Number 9 Vertex Connectivity 2

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.