Graph details

Graph # 33720

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

Gunnar Brinkmann

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 4.026
Algebraic Connectivity 0.777 Laplacian Largest Eigenvalue 7.198
Average Degree 4 Longest Induced Cycle 9
Bipartite No Longest Induced Path 9
Chromatic Index 5 Matching Number 8
Chromatic Number 3 Maximum Degree 5
Circumference 16 Minimum Degree 3
Claw-Free No Minimum Dominating Set 4
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 32
Density 0.267 Number of Triangles 12
Diameter 4 Number of Vertices 16
Edge Connectivity 3 Planar Yes
Eulerian No Radius 3
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 3.209
Hamiltonian Yes Smallest Eigenvalue -3.043
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 Gunnar Brinkmann at May 28, 2019 5:32 PM.
ham_pol_min_1cut -- the unique polyhedron with one 3-cut and minimum number of hamiltonian cycles on this number of vertices

You need to be logged in to be able to add comments.