Travel groupoids on complete multipartite graphs
Diogo Kendy Matsumoto
TL;DR
This paper characterizes travel groupoids on finite complete multipartite graphs, establishing their properties and enumerating the total number of such structures, thereby advancing the algebraic understanding of graph-related systems.
Contribution
It provides a complete characterization and enumeration of travel groupoids specifically on finite complete multipartite graphs, a novel contribution in algebraic graph theory.
Findings
Characterization of travel groupoids on complete multipartite graphs
Enumeration formulas for the number of such groupoids
Insights into algebraic structures related to these graphs
Abstract
A travel groupoid is an algebraic system satisfying two suitable conditions, which has a relation to graphs. In this article, we characterize travel groupoids on finite complete multipartite graphs, and we give the numbers of travel groupoids on the complete multipartite graphs.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Topics in Algebra · Fuzzy and Soft Set Theory · Homotopy and Cohomology in Algebraic Topology