A Simplical Complex-Based Kernel Estimation Method for Cracking
Higher-Order Graph Structures in Cell Complex Topology
Eman Almuhur1,∗ , Nabeela Abu-Al Kishik2, Hamza Qoqazeh3, Ali Atoom4, Manal Al-Labadi5,
Wasim Audeh5
1Department of Mathematics, Applied Science Private University, Jordan
2Department of Mathematics, Jerash University, Jordan
3Department of Mathematics, Irbid National University, Jordan
4Department of Mathematics, Ajloun National University, Jordan
5Department of Mathematics, University of Petra, Jordan
Emails: e almuhur@asu.edu.jo; Nabeelakishik@yahoo.com; hhaaqq983@gmail.com; aliatoom@anu.edu.jo;
manal.allabadi@uop.edu.jo; waudeh@uop.edu.jo
Abstract
The primary goal of the article is to examine the data s shape and crack higher-order graph structures in cell
complex topology. Further simplical complex-based kernel estimation methods are explored and discussed.
Keywords: Simplicial complex; Euler characteristic; Simplicial homology; Cell complex topology