Graph details

Graph # 33553

Adjacency matrix

000000000001
000000000100
000000000100
000000000010
000000010000
000000000011
000000001001
000010001000
000000110000
011000000010
000101000100
100001100000

Adjacency list

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

HoG graph id

33553

Graph name

Seidel Cospectral Tree N=12

Graph submitted by

Kevin Ryde

Invariant values

The definitions of the invariants can be found here.
Invariant Value Invariant Value
Acyclic Yes Index 2.147
Algebraic Connectivity 0.097 Laplacian Largest Eigenvalue 4.709
Average Degree 1.833 Longest Induced Cycle undefined
Bipartite Yes Longest Induced Path 8
Chromatic Index 3 Matching Number 5
Chromatic Number 2 Maximum Degree 3
Circumference undefined Minimum Degree 1
Claw-Free No Minimum Dominating Set 4
Clique Number 2 Number of Components 1
Connected Yes Number of Edges 11
Density 0.167 Number of Triangles 0
Diameter 8 Number of Vertices 12
Edge Connectivity 1 Planar Yes
Eulerian No Radius 4
Genus 0 Regular No
Girth undefined Second Largest Eigenvalue 1.82
Hamiltonian No Smallest Eigenvalue -2.147
Independence Number 7 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 Feb 9, 2019 7:06 AM.
This tree has its Seidel adjacency matrix cospectral with another n=12 tree. N=12 is the fewest vertices where Seidel cospectral trees occur and this pair is the only such n=12. This tree is bicentroidal and its partner is unicentroidal.

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