Graph details

Graph # 33655

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name


Graph submitted by

Princewill Okoroafor

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 6.873
Algebraic Connectivity 4.354 Laplacian Largest Eigenvalue 10
Average Degree 6.857 Longest Induced Cycle 18
Bipartite No Longest Induced Path 19
Chromatic Index Computation time out Matching Number 24
Chromatic Number 4 Maximum Degree 7
Circumference 49 Minimum Degree 6
Claw-Free No Minimum Dominating Set 7
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 168
Density 0.143 Number of Triangles 0
Diameter 3 Number of Vertices 49
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 2
Genus Computation time out Regular No
Girth 5 Second Largest Eigenvalue 2
Hamiltonian Yes Smallest Eigenvalue -3
Independence Number 15 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 Princewill Okoroafor at May 8, 2019 2:24 AM.
Extremal graph without 3-cycle or 4-cycle on 49 vertices (168 edges)

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