Graph details

Graph # 33741

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon Curve Level 5

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 2.794
Algebraic Connectivity 0.026 Laplacian Largest Eigenvalue 6.224
Average Degree 2.207 Longest Induced Cycle 4
Bipartite Yes Longest Induced Path 18
Chromatic Index 4 Matching Number 13
Chromatic Number 2 Maximum Degree 4
Circumference 6 Minimum Degree 1
Claw-Free No Minimum Dominating Set 9
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 32
Density 0.079 Number of Triangles 0
Diameter 18 Number of Vertices 29
Edge Connectivity 1 Planar Yes
Eulerian No Radius 9
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 2.368
Hamiltonian No Smallest Eigenvalue -2.794
Independence Number 16 Vertex Connectivity 1

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 10:40 AM.
The Heighway/Harter dragon curve as a graph.

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