Graph details

Graph # 35445

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id

35445

Graph name

n/a

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

A table row rendered like this indicates that the graph is marked as being interesting for that invariant.

Comments

Posted by Steven Van Overberghe at Jun 8, 2020 5:01 PM.
Extremal Ramsey graph containing no W7 as a subgraph, nor a W4(=K4) in the complement, establishing R(W7,W4)=21.

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