Graph details

Graph # 33751

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id

33751

Graph name

Dragon Curve Blob 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.289
Algebraic Connectivity 0.064 Laplacian Largest Eigenvalue 7.027
Average Degree 2.765 Longest Induced Cycle 10
Bipartite Yes Longest Induced Path 16
Chromatic Index 4 Matching Number 16
Chromatic Number 2 Maximum Degree 4
Circumference 14 Minimum Degree 2
Claw-Free No Minimum Dominating Set 11
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 47
Density 0.084 Number of Triangles 0
Diameter 12 Number of Vertices 34
Edge Connectivity 2 Planar Yes
Eulerian No Radius 6
Genus 0 Regular No
Girth 4 Second Largest Eigenvalue 2.823
Hamiltonian No Smallest Eigenvalue -3.289
Independence Number 18 Vertex Connectivity 1

A table row rendered like this indicates that the graph is marked as being interesting for that invariant.

Comments

Posted by Kevin Ryde at Jul 11, 2019 11:36 AM.
The Heighway/Harter dragon curve comprises blobs of touching enclosed unit squares, being maximal 2-edge-connected subgraphs. The present graph is blob 7 which is the biggest occurring in curve level 7. The degree 3 vertices are where the rest of the curve connects.

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