Graph details

Graph # 33745

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Dragon Curve Level 7

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic No Index 3.322
Algebraic Connectivity 0.005 Laplacian Largest Eigenvalue 7.118
Average Degree 2.535 Longest Induced Cycle 10
Bipartite Yes Longest Induced Path 38
Chromatic Index 4 Matching Number 47
Chromatic Number Computation time out Maximum Degree 4
Circumference 14 Minimum Degree 1
Claw-Free No Minimum Dominating Set Computation time out
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 128
Density 0.025 Number of Triangles 0
Diameter 36 Number of Vertices 101
Edge Connectivity 1 Planar Computation time out
Eulerian No Radius 18
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 3.022
Hamiltonian No Smallest Eigenvalue -3.322
Independence Number Computation time out 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 11:09 AM.
The Heighway/Harter dragon curve as a graph.

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