Blog Archive

Sunday, October 22, 2023

Degree sequence: an algebra approach

In graph theory, we know an important graph invariant is degree sequence.

In this essay, I will make this invariant much more interesting.

I will consider a function

(1)F:FGraph⟶Z−Alg

The idea is simple.

If you consider any finite connected graph G, you could consider all the functions from vertex to Z.

This will form a Ring, but it is pretty boring. Since FG1≅FG2⟺|G1|=|G2|.

i.e.

(3)FG=Z⊕|G|

Glue two graph together correspond to ⊕, cut some part of graph correspond to quotient.

To improve this algebra invariant, we could consider those functions taking value at Zdeg⁡(vi) at each vertex.

Where Zdeg⁡(vi) is Z/deg⁡(vi)Z.

Let I be the function (not a functor).

i.e.

(4)I(G)=⨁i=1nZdeg⁡(vi)

Remark

†.G The degree function on a graph is 0G in this algebra!

†.G is a loop or a line ⟺ I(G)≅Z2⊕n i.e. Boolean Ring!

†.G have not singleton point ⟺ |I(G)|<∞.

 

 

 

Popular Posts