Graph details

Graph # 33708

Adjacency matrix

00000110001
00010101001
00001010101
01001000011
00110000011
11000011000
10100100100
01000100110
00100011010
00011001100
11111000000

Adjacency list

1: 6 7 11
2: 4 6 8 11
3: 5 7 9 11
4: 2 5 10 11
5: 3 4 10 11
6: 1 2 7 8
7: 1 3 6 9
8: 2 6 9 10
9: 3 7 8 10
10: 4 5 8 9
11: 1 2 3 4 5

HoG graph id

33708

Graph name

n/a

Graph submitted by

Gunnar Brinkmann

Invariant values

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

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

Comments

Posted by Gunnar Brinkmann at May 28, 2019 5:28 PM.
ham_pol_min_1cut -- one of the two polyhedra with one 3-cut and minimum number of hamiltonian cycles on this number of vertices

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