Graph details

Graph # 45622

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 37
Algebraic Connectivity 30.764 Laplacian Largest Eigenvalue 48
Average Degree 37 Longest Induced Cycle 11
Bipartite No Longest Induced Path 10
Chromatic Index Computation time out Matching Number 40
Chromatic Number Computation time out Maximum Degree 37
Circumference 80 Minimum Degree 37
Claw-Free No Minimum Dominating Set 4
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 1480
Density 0.468 Number of Triangles 7520
Diameter 2 Number of Vertices 80
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 2
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 6.236
Hamiltonian Yes Smallest Eigenvalue -11
Independence Number 7 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 Jul 1, 2021 2:37 PM.
Circulant Ramsey-(K5,K8-e;80)-graph.

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