Graph details

Graph # 33743

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon Curve Level 6

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.022
Algebraic Connectivity 0.012 Laplacian Largest Eigenvalue 6.663
Average Degree 2.37 Longest Induced Cycle 4
Bipartite Yes Longest Induced Path 26
Chromatic Index 4 Matching Number 25
Chromatic Number 2 Maximum Degree 4
Circumference 8 Minimum Degree 1
Claw-Free No Minimum Dominating Set 17
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 64
Density 0.045 Number of Triangles 0
Diameter 26 Number of Vertices 54
Edge Connectivity 1 Planar Yes
Eulerian No Radius 13
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 2.791
Hamiltonian No Smallest Eigenvalue -3.022
Independence Number 29 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:48 AM.
The Heighway/Harter dragon curve as a graph.

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