Semigroups of transformations and endomorphisms have emerged as powerful algebraic frameworks to elucidate the underlying structures of graphs. By harnessing the principles of semigroup theory ...

Triangle Counting: The process of identifying and enumerating all sets of three interconnected vertices in a graph, serving as a pivotal metric in network analysis.

Abstract Let Kn be a complete graph with n vertices, Ck denote a cycle of length k, and Sk denote a star with k edges. If k = 3, then we call C3 a triangle and S3 a claw. In this paper, we show that ...