Graph details

Graph # 34163

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon Curve Blob 9

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.741
Algebraic Connectivity 0.018 Laplacian Largest Eigenvalue 7.697
Average Degree 3.053 Longest Induced Cycle Computation time out
Bipartite Yes Longest Induced Path Computation time out
Chromatic Index Computation time out Matching Number 64
Chromatic Number Computation time out Maximum Degree 4
Circumference Computation time out Minimum Degree 2
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 203
Density 0.023 Number of Triangles 0
Diameter 26 Number of Vertices 133
Edge Connectivity Computation time out Planar Computation time out
Eulerian No Radius 13
Genus Computation time out Regular No
Girth 4 Second Largest Eigenvalue 3.508
Hamiltonian Computation time out Smallest Eigenvalue -3.741
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 Nov 30, 2019 7:30 AM.
The Heighway/Harter dragon curve comprises blobs of touching enclosed unit squares, being maximal 2-edge-connected subgraphs. The present graph is blob 9 which is the biggest occurring in curve level 9. The degree 3 vertices are where the rest of the curve connects.

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