Hamiltonicity in power graphs of a class of abelian groups
Por:
Santiago Arguello A., Montellano-Ballesteros J.J., Stadler P.F.
Publicada:
1 ene 2023
Resumen:
The undirected power graph G(S) of a semigroup S is an undirected graph with vertex set S where two vertices u, v? S are adjacent if and only if there is a positive integer m such that um= v or vm= u. Here, we investigate the power graphs of a class of abelian groups and answer, in this case, the question whether or not the power graph is Hamiltonian. © 2022, The Author(s).
Filiaciones:
Santiago Arguello A.:
Bioinformatics Group, Department of Computer Science, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
Interdisciplinary Center of Bioinformatics, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
Montellano-Ballesteros J.J.:
Instituto de Matemáticas, Universidad Nacional Autónoma de México, Ciudad Universitaria, CDMX, México, C.P. 04510, Mexico
Stadler P.F.:
Bioinformatics Group, Department of Computer Science, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
Interdisciplinary Center of Bioinformatics, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
German Centre for Integrative Biodiversity Research (iDiv) Halle-Jena-Leipzig, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
Competence Center for Scalable Data Services and Solutions, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
Leipzig Research Center for Civilization Diseases, Leipzig University, Härtelstraße 16-18, Leipzig, 04107, Germany
Max-Planck-Institute for Mathematics in the Sciences, Inselstraße 22, Leipzig, 04103, Germany
Institute for Theoretical Chemistry, University of Vienna, Währingerstraße 17, Wien, 1090, Austria
Facultad de Ciencias, Universidad National de Colombia, Sede Bogotá, Colombia
Santa Fe Institute, 1399 Hyde Park Rd., Santa Fe, NM 87501, United States
Hybrid Gold
|