Graph details

Graph # 33753

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon Curve Blob 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.567
Algebraic Connectivity 0.033 Laplacian Largest Eigenvalue 7.465
Average Degree 2.941 Longest Induced Cycle 22
Bipartite Yes Longest Induced Path 30
Chromatic Index Computation time out Matching Number 32
Chromatic Number 2 Maximum Degree 4
Circumference 42 Minimum Degree 2
Claw-Free No Minimum Dominating Set 21
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 100
Density 0.044 Number of Triangles 0
Diameter 18 Number of Vertices 68
Edge Connectivity 2 Planar Yes
Eulerian No Radius 9
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 3.206
Hamiltonian No Smallest Eigenvalue -3.567
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:40 AM.
The Heighway/Harter dragon curve comprises blobs of touching enclosed unit squares, being maximal 2-edge-connected subgraphs. The present graph is blob 8 which is the biggest occurring in curve level 8. The degree 3 vertices are where the rest of the curve connects.

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