Graph details

Graph # 35477

Adjacency matrix

00110000
00001100
10000011
10000011
01000011
01000011
00111100
00111100

Adjacency list

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

HoG graph id

35477

Graph name

Optical Illusion, 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 3.162
Algebraic Connectivity 1 Laplacian Largest Eigenvalue 6.562
Average Degree 3 Longest Induced Cycle 4
Bipartite Yes Longest Induced Path 4
Chromatic Index 4 Matching Number 4
Chromatic Number 2 Maximum Degree 4
Circumference 8 Minimum Degree 2
Claw-Free No Minimum Dominating Set 3
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 12
Density 0.429 Number of Triangles 0
Diameter 4 Number of Vertices 8
Edge Connectivity 2 Planar Yes
Eulerian No Radius 2
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 1.414
Hamiltonian Yes Smallest Eigenvalue -3.162
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 Jul 28, 2020 11:42 AM.
Filled Avatar Graph (https://github.com/advancedresearch/avatar_graph). Produces an optical illusion, aka M.C. Escher when arranged in the plane by its circumference.

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