Travel groupoids on complete multipartite graphs
Combinatorics
2024-12-10 v1
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.
Keywords
Cite
@article{arxiv.2412.05510,
title = {Travel groupoids on complete multipartite graphs},
author = {Diogo Kendy Matsumoto},
journal= {arXiv preprint arXiv:2412.05510},
year = {2024}
}