Graph details

Graph # 34628

Adjacency matrix

[Too large to display]

Adjacency list

[Too large to display]

HoG graph id


Graph name

Complete Ternary Tree, height 4 (5 rows, 121 vertices)

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic Yes Index 3
Algebraic Connectivity 0.018 Laplacian Largest Eigenvalue 6.803
Average Degree 1.983 Longest Induced Cycle undefined
Bipartite Yes Longest Induced Path 8
Chromatic Index Computation time out Matching Number 30
Chromatic Number 2 Maximum Degree 4
Circumference undefined Minimum Degree 1
Claw-Free No Minimum Dominating Set 28
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 120
Density 0.017 Number of Triangles 0
Diameter 8 Number of Vertices 121
Edge Connectivity 1 Planar Yes
Eulerian No Radius 4
Genus 0 Regular No
Girth undefined Second Largest Eigenvalue 2.803
Hamiltonian No Smallest Eigenvalue -3
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 May 20, 2020 6:53 AM.
The centre is the root vertex and each vertex has 3 children until the leaves.

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