Graph details

Graph # 44059

Adjacency matrix

011000000
100001001
100000110
000011010
000100101
010100100
001011000
001100001
010010010

Adjacency list

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

HoG graph id

44059

Graph name

Associativity, Filled Avatar Graph

Graph submitted by

Sven Nilsen

Invariant values

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

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

Comments

Posted by Sven Nilsen at Oct 27, 2020 4:06 AM.
Filled Avatar Graph (https://github.com/advancedresearch/avatar_graph). Models associativity. 9 vertices is unusual for filled avatar graphs.

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