Graph details

Graph # 34333

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 10
Algebraic Connectivity 7.459 Laplacian Largest Eigenvalue 13.541
Average Degree 10 Longest Induced Cycle 7
Bipartite No Longest Induced Path 6
Chromatic Index Computation time out Matching Number 10
Chromatic Number 6 Maximum Degree 10
Circumference 21 Minimum Degree 10
Claw-Free No Minimum Dominating Set 3
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 105
Density 0.5 Number of Triangles 140
Diameter 2 Number of Vertices 21
Edge Connectivity Computation time out Planar Computation time out
Eulerian Yes Radius 2
Genus Computation time out Regular Yes
Girth 3 Second Largest Eigenvalue 2.541
Hamiltonian Yes Smallest Eigenvalue -3.541
Independence Number 4 Vertex Connectivity 10

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


Posted by Steven Van Overberghe at Mar 23, 2020 3:14 PM.
Unique largest graph containing no K5-e as a subgraph, nor a K5-e in the complement, establishing R(K5-e)=22.

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