Research work · 2023

Looped homology theory of weighted reflexive graphs

Sahawat Wongkhunen, Pongdate Montagantirud

Abstract

In recent years, the notions of discrete homotopy for graphs, such as A-homotopy, x-homotopy and fundamental groupoid for graphs, have been introduced. Next, these theories are developed and extended for further studies, motivating us to study the discrete homology theory of graphs. This dissertation develops the notion of a looped fundamental groupoid for graphs to the isotropy group of the vertex v in the fundamental groupoid. We show that it is similar to the classical fundamental group of a topological space and the A-theory of graphs in some sense. Then, we apply this theory's idea to the looped fundamental group of weighted reflexive graphs, depending on r>0, and look into some properties that can be used to classify weighted reflexive graphs in different situations. In addition, we define and examine the looped homology theory of weighted reflexive graphs, depending on r>0, related to the looped fundamental group. We can compute the looped homology group of the weighted reflexive n-spheres showing that the theory is not trivial and can detect n-dimensional holes in weighted reflexive graphs. Finally, we mention applying this theory to examining data structures such as communication networks, traffic networks, and transportation systems.

DOI: 10.58837/chula.the.2023.1397