Graph details

Graph # 33739

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon curve level 4

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 2.383
Algebraic Connectivity 0.057 Laplacian Largest Eigenvalue 5.375
Average Degree 2 Longest Induced Cycle 4
Bipartite Yes Longest Induced Path 12
Chromatic Index 4 Matching Number 7
Chromatic Number 2 Maximum Degree 4
Circumference 4 Minimum Degree 1
Claw-Free No Minimum Dominating Set 6
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 16
Density 0.133 Number of Triangles 0
Diameter 12 Number of Vertices 16
Edge Connectivity 1 Planar Yes
Eulerian No Radius 6
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 1.836
Hamiltonian No Smallest Eigenvalue -2.383
Independence Number 9 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 10, 2019 10:11 AM.
The Heighway/Harter dragon curve as a graph. This expansion level is the first with a double-visited point (degree=4 in the graph), but is merely a unit square with paths start and end.

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