Graph details

Graph # 33988

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 0.533 Laplacian Largest Eigenvalue 6.886
Average Degree 4 Longest Induced Cycle 10
Bipartite No Longest Induced Path 9
Chromatic Index 5 Matching Number 8
Chromatic Number 4 Maximum Degree 4
Circumference 17 Minimum Degree 4
Claw-Free No Minimum Dominating Set 4
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 34
Density 0.25 Number of Triangles 10
Diameter 4 Number of Vertices 17
Edge Connectivity 4 Planar No
Eulerian Yes Radius 3
Genus 2 Regular Yes
Girth 3 Second Largest Eigenvalue 3.467
Hamiltonian Yes Smallest Eigenvalue -2.886
Independence Number 6 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 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.