Graph details

Graph # 45696

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 5
Algebraic Connectivity 1 Laplacian Largest Eigenvalue 8.367
Average Degree 5 Longest Induced Cycle Computation time out
Bipartite No Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 42
Chromatic Number 4 Maximum Degree 5
Circumference Computation time out Minimum Degree 5
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 210
Density 0.06 Number of Triangles 28
Diameter 5 Number of Vertices 84
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 5
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 4
Hamiltonian Computation time out Smallest Eigenvalue -3.367
Independence Number Computation time out 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 3:05 PM.
A small prime minimal Cayley graph of chromatic number 4. It is a Cayley graph of (Z14 X Z2) ⋊ Z3 wrt one generators of order 2, one of order 3, and one of order 7.

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