Graph details

Graph # 35443

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 9
Algebraic Connectivity 6 Laplacian Largest Eigenvalue 12
Average Degree 9 Longest Induced Cycle 6
Bipartite No Longest Induced Path 4
Chromatic Index Computation time out Matching Number 9
Chromatic Number 6 Maximum Degree 9
Circumference 18 Minimum Degree 9
Claw-Free Yes Minimum Dominating Set 3
Clique Number 6 Number of Components 1
Connected Yes Number of Edges 81
Density 0.529 Number of Triangles 120
Diameter 2 Number of Vertices 18
Edge Connectivity 9 Planar Computation time out
Eulerian No Radius 2
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 3
Hamiltonian Yes Smallest Eigenvalue -3
Independence Number 3 Vertex Connectivity 8

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 4, 2020 5:24 PM.
Extremal Ramsey graph containing no W7 nor a W7 in the complement, establishing R(W7,W7)=19.

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