Graph details

Graph # 33716

Adjacency matrix

00000110000001
00000000011011
00001010100001
00001000000111
00110000000101
10000010101000
10100100100000
00000000011110
00100110000100
01000001001010
01000101010000
00011001100000
01010001010000
11111000000000

Adjacency list

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

HoG graph id

33716

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.035
Algebraic Connectivity 0.923 Laplacian Largest Eigenvalue 7.038
Average Degree 4 Longest Induced Cycle 8
Bipartite No Longest Induced Path 7
Chromatic Index 5 Matching Number 7
Chromatic Number 3 Maximum Degree 5
Circumference 14 Minimum Degree 3
Claw-Free No Minimum Dominating Set 3
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 28
Density 0.308 Number of Triangles 10
Diameter 4 Number of Vertices 14
Edge Connectivity 3 Planar Yes
Eulerian No Radius 3
Genus 0 Regular No
Girth 3 Second Largest Eigenvalue 3.014
Hamiltonian Yes Smallest Eigenvalue -2.825
Independence Number 5 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:31 PM.
ham_pol_min_1cut -- the unique polyhedron 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.