Graph details

Graph # 36263

Adjacency matrix

01111100
10110110
11001101
11001011
10110011
11100011
01011101
00111110

Adjacency list

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

HoG graph id

36263

Graph name

\co{C_8}

Graph submitted by

Diego de Estrada

Invariant values

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

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

Comments

Posted by Diego de Estrada at Sep 1, 2020 3:51 PM.
Complement of C_8.

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