Graph details

Graph # 45688

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

Kolja Knauer

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 6
Algebraic Connectivity 1.809 Laplacian Largest Eigenvalue 10.509
Average Degree 6 Longest Induced Cycle Computation time out
Bipartite No Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 36
Chromatic Number Computation time out Maximum Degree 6
Circumference 72 Minimum Degree 6
Claw-Free No Minimum Dominating Set 12
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 216
Density 0.085 Number of Triangles 24
Diameter 4 Number of Vertices 72
Edge Connectivity Computation time out Planar Computation time out
Eulerian Yes Radius 4
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 4.191
Hamiltonian Yes Smallest Eigenvalue -4.509
Independence Number 24 Vertex Connectivity Computation time out

A table row rendered like this indicates that the graph is marked as being interesting for that invariant.


Posted by Kolja Knauer at Sep 5, 2021 2:59 PM.
A small prime minimal Cayley graph of chromatic number 4. It is a Cayley graph of (Z3 X Z3) ⋊ Q8, where Q is the Quaternion group wrt one generator of order 3 and two of order 4.

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