Graph details

Graph # 33662

Adjacency matrix

00010000
00010000
00000111
11001000
00010111
00101011
00101101
00101110

Adjacency list

1: 4
2: 4
3: 6 7 8
4: 1 2 5
5: 4 6 7 8
6: 3 5 7 8
7: 3 5 6 8
8: 3 5 6 7

HoG graph id

33662

Graph name

counterexample

Graph submitted by

Sancuan Zhang

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.698
Algebraic Connectivity 0.354 Laplacian Largest Eigenvalue 5.646
Average Degree 3 Longest Induced Cycle 3
Bipartite No Longest Induced Path 4
Chromatic Index 5 Matching Number 3
Chromatic Number 4 Maximum Degree 4
Circumference 5 Minimum Degree 1
Claw-Free No Minimum Dominating Set 2
Clique Number 4 Number of Components 1
Connected Yes Number of Edges 12
Density 0.429 Number of Triangles 7
Diameter 4 Number of Vertices 8
Edge Connectivity 1 Planar Yes
Eulerian No Radius 2
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 1.596
Hamiltonian No Smallest Eigenvalue -2.063
Independence Number 4 Vertex Connectivity 1

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

Comments

Posted by Sancuan Zhang at May 14, 2019 4:12 AM.
Not class 1.

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