Graph details

Graph # 32271

Adjacency matrix

0000000001
0000000001
0000000010
0000000010
0000001000
0000000100
0000100001
0000010001
0011000001
1100001110

Adjacency list

1: 10
2: 10
3: 9
4: 9
5: 7
6: 8
7: 5 10
8: 6 10
9: 3 4 10
10: 1 2 7 8 9

HoG graph id

32271

Graph name

Tree Automorphisms E8, N=10

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic Yes Index 2.433
Algebraic Connectivity 0.303 Laplacian Largest Eigenvalue 6.229
Average Degree 1.8 Longest Induced Cycle undefined
Bipartite Yes Longest Induced Path 4
Chromatic Index 5 Matching Number 4
Chromatic Number 2 Maximum Degree 5
Circumference undefined Minimum Degree 1
Claw-Free No Minimum Dominating Set 4
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 9
Density 0.2 Number of Triangles 0
Diameter 4 Number of Vertices 10
Edge Connectivity 1 Planar Yes
Eulerian No Radius 2
Genus 0 Regular No
Girth undefined Second Largest Eigenvalue 1.296
Hamiltonian No Smallest Eigenvalue -2.433
Independence Number 6 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 Dec 15, 2018 6:45 AM.
This tree has automorphism group E8 = C2xC2xC2. Its n=10 vertices is the fewest for trees of this group. It is one of two such n=10. This one has 2 fixed vertices.

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