Graph details

Graph # 34272

Adjacency matrix

001001001
000110001
100010100
010001010
011000101
100100011
001010011
000101101
110011110

Adjacency list

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

HoG graph id

34272

Graph name

n/a

Graph submitted by

Elisabeth Gaar

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.982
Algebraic Connectivity 1.697 Laplacian Largest Eigenvalue 7.303
Average Degree 3.778 Longest Induced Cycle 6
Bipartite No Longest Induced Path 5
Chromatic Index 6 Matching Number 4
Chromatic Number 3 Maximum Degree 6
Circumference 9 Minimum Degree 3
Claw-Free No Minimum Dominating Set 2
Clique Number 3 Number of Components 1
Connected Yes Number of Edges 17
Density 0.472 Number of Triangles 7
Diameter 3 Number of Vertices 9
Edge Connectivity 3 Planar No
Eulerian No Radius 2
Genus 1 Regular No
Girth 3 Second Largest Eigenvalue 1.732
Hamiltonian Yes Smallest Eigenvalue -2.327
Independence Number 3 Vertex Connectivity 3

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

Comments

Posted by Elisabeth Gaar at Feb 5, 2020 2:18 PM.
The second level of the exact subgraph hierarchy and the compressed exact subgraph hierarchy differ a lot for this graph.

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