## Adjacency matrix[Too large to display] |
## Adjacency list[Too large to display] |

33749

Dragon Curve Blob 6

Kevin Ryde

Invariant | Value | Invariant | Value |
---|---|---|---|

Acyclic | No | Index | 2.926 |

Algebraic Connectivity | 0.152 | Laplacian Largest Eigenvalue | 6.353 |

Average Degree | 2.588 | Longest Induced Cycle | 4 |

Bipartite | Yes | Longest Induced Path | 9 |

Chromatic Index | 4 | Matching Number | 8 |

Chromatic Number | 2 | Maximum Degree | 4 |

Circumference | 8 | Minimum Degree | 2 |

Claw-Free | No | Minimum Dominating Set | 6 |

Clique Number | 2 | Number of Components | 1 |

Connected | Yes | Number of Edges | 22 |

Density | 0.162 | Number of Triangles | 0 |

Diameter | 8 | Number of Vertices | 17 |

Edge Connectivity | 2 | Planar | Yes |

Eulerian | No | Radius | 4 |

Genus | 0 | Regular | No |

Girth | 4 | Second Largest Eigenvalue | 2.425 |

Hamiltonian | No | Smallest Eigenvalue | -2.926 |

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 11, 2019 11:31 AM.

The Heighway/Harter dragon curve comprises blobs of touching enclosed unit squares, being maximal 2-edge-connected subgraphs. The present graph is blob 6 which is the biggest occurring in curve level 6. The degree 3 vertices are where the rest of the curve connects.

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