Abstract
A travel groupoid is an algebraic system related to graphs, which was defined by Nebeský in 2006. In this article, we characterize simple non-confusing travel groupoids on a finite graph in two ways. One is given by using spanning trees of the graph and the other by its subgroupoids. Furthermore, we introduce a way to construct a simple non-confusing travel groupoid on a given finite graph by using the spanning trees, and we count numbers of simple non-confusing travel groupoids on cycle graphs and cactus graphs.
Similar content being viewed by others
References
Cho, J.R., Park, J., Sano, Y.: The non-confusing travel groupoids on a finite connected graph. Lect. Notes Comput. Sci. 8845, 14–17 (2014)
Cho, J.R., Park, J., Sano, Y.: Travel groupoids on infinite graphs. Czechoslov. Math. J. 64, 763–766 (2014)
Cho, J.R., Park, J., Sano, Y.: \(T\)-neighbor systems and travel groupoids on a graph. Graphs Comb. 33(6), 1521–1529 (2017)
Matsumoto, D.K., Mizusawa, A.: A construction of smooth travel groupoids on finite graphs. Graphs Comb. 32(3), 1117–1124 (2016)
Nebeský, L.: An algebraic characterization of geodetic graphs. Czechoslov. Math. J. 48(123), 701–710 (1998)
Nebeský, L.: A tree as a finite nonempty set with a binary operation. Math. Bohem. 125, 455–458 (2000)
Nebeský, L.: New proofs of a characterization of geodetic graphs. Czechoslov. Math. J. 52(127), 33–39 (2002)
Nebeský, L.: Travel groupoids. Czechoslov. Math. J. 56(131), 659–675 (2006)
Author information
Authors and Affiliations
Corresponding author
Additional information
Publisher's Note
Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.
Rights and permissions
About this article
Cite this article
Matsumoto, D.K., Mizusawa, A. Characterizations of the Simple Non-Confusing Travel Groupoids on a Finite Graph. Graphs and Combinatorics 35, 321–334 (2019). https://doi.org/10.1007/s00373-018-1995-4
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00373-018-1995-4