Graph details

Graph # 33747

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon Curve Level 8

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.572
Algebraic Connectivity 0.003 Laplacian Largest Eigenvalue 7.474
Average Degree 2.695 Longest Induced Cycle 22
Bipartite Yes Longest Induced Path 64
Chromatic Index Computation time out Matching Number 89
Chromatic Number Computation time out Maximum Degree 4
Circumference Computation time out Minimum Degree 1
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 256
Density 0.014 Number of Triangles 0
Diameter 52 Number of Vertices 190
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 26
Genus Computation time out Regular No
Girth 4 Second Largest Eigenvalue 3.322
Hamiltonian Computation time out Smallest Eigenvalue -3.572
Independence Number Computation time out Vertex Connectivity Computation time out

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


Posted by Kevin Ryde at Jul 11, 2019 11:18 AM.
The Heighway/Harter dragon curve as a graph.

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