EUVIMEDEUVIMED entdecken
Crossref

Looped Homology Theory of Weighted Graphs

Sahawat Wongkhunen, Pongdate Montagantirud

Studia Scientiarum Mathematicarum Hungarica · 03.08.2026 · 63 (2) · 141-164

DOI: 10.1556/012.2026.04353 ↗

Kurz gefasst

Fachartikel in der Zeitschrift Studia Scientiarum Mathematicarum Hungarica, erschienen am 03.08.2026. Verfasst von Sahawat Wongkhunen und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

The notions of the discrete homology theory of graphs have been widely introduced. In this paper, we define and examine the looped homology theory of weighted reflexive graphs with a parameter 𝑟 > 0 via the categorical product of graphs. We show that the theory is related to one of the homology theories of reflexive graphs, defined in [19]. We also provide some examples showing the theory is not trivial and can detect 𝑛-dimensional holes in weighted reflexive graphs depending on 𝑟 > 0. After that, we prove that the theory satisfies the discrete analog of the Mayer–Vietoris exact sequence and the Eilenberg–Steenrod axioms. Finally, we study the notions of 𝑟-contractible and 𝑟-trivial weighted reflexive graphs. We show that our theory doesn’t yield the same answers as the singular homology theory of a topological space induced by a weighted reflexive graph.

Zitieren

APA

Wongkhunen, S., & Montagantirud, P. (2026). Looped Homology Theory of Weighted Graphs. Studia Scientiarum Mathematicarum Hungarica, 63(2), 141-164. https://doi.org/10.1556/012.2026.04353

Vancouver

Wongkhunen S, Montagantirud P. Looped Homology Theory of Weighted Graphs. Studia Scientiarum Mathematicarum Hungarica. 2026;63(2):141-164. doi:10.1556/012.2026.04353

BibTeX
@article{Wongkhunen2026,
  author = {Wongkhunen, Sahawat and Montagantirud, Pongdate},
  title = {Looped Homology Theory of Weighted Graphs},
  journal = {Studia Scientiarum Mathematicarum Hungarica},
  year = {2026},
  volume = {63},
  number = {2},
  pages = {141--164},
  doi = {10.1556/012.2026.04353}
}
Kostenlos starten →