Graph details

Graph # 45615

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

Steven Van Overberghe

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 23.369
Algebraic Connectivity 16 Laplacian Largest Eigenvalue 32
Average Degree 23.333 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 24
Circumference 72 Minimum Degree 22
Claw-Free No Minimum Dominating Set 5
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 840
Density 0.329 Number of Triangles 1728
Diameter 2 Number of Vertices 72
Edge Connectivity Computation time out Planar Computation time out
Eulerian Yes Radius 2
Genus Computation time out Regular No
Girth 3 Second Largest Eigenvalue 8
Hamiltonian Yes Smallest Eigenvalue -8
Independence Number 8 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 Steven Van Overberghe at Jun 14, 2021 10:23 AM.
Block-circulant R(K4,K9;72)-graph.

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