AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
PDF (254 KB)
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Research Article | Open Access

On t-Cayley hypergraphs of cyclic groups with vertex transitive property on the set of non-injective endomorphisms

Tanapat ChalaruxSayan Panma( )
Department of Mathematics, Faculty of Science, Chiang Mai University, Chiang Mai 50200, Thailand
Show Author Information

Abstract

Hypergraphs provide a powerful framework for modeling polyadic relationships, generalizing classical graph structures. t-Cayley hypergraphs, a natural extension of Cayley graphs, are inherently vertex-transitive under the automorphism group ( A u t ). However, this vertex-transitivity is not necessarily preserved when replacing A u t with non-injective endomorphisms ( E n d ). This work investigates the precise conditions under which t-Cayley hypergraphs of finite cyclic groups retain this property. Our main result establishes that a t-Cayley hypergraph H over the cyclic group Z n is E n d -vertex-transitive if t divides n.

CLC number: 05C25, 05C60, 05C65, 20B15

References

【1】
【1】
 
 
AIMS Mathematics
Pages 19031-19045

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Chalarux T, Panma S. On t-Cayley hypergraphs of cyclic groups with vertex transitive property on the set of non-injective endomorphisms. AIMS Mathematics, 2026, 11(6): 19031-19045. https://doi.org/10.3934/math.2026775

2

Views

0

Downloads

0

Crossref

0

Web of Science

0

Scopus

Received: 16 January 2026
Revised: 10 June 2026
Accepted: 22 June 2026
Published: 15 June 2026
©2026 the Author(s), licensee AIMS Press.

This is an open access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0)