Extension of Paul Erdős graph on hypergroups
Abstract This paper introduces ultra non-commutative graphs derived from ultra non-commutative hypergroups. Vertices represent ultra non -commutative elements of the hypergroup U, defined as A U = {x ∈ U | Ǝ y ∈ U, y ○ x ∩ x ○ y = ∅}. An edge connects vertices x and y if and only if y ○ x ∩ x ○ y = ∅. We investigate properties of the associated graph Γ( U ), including connectivity, Hamiltonian conditions, and planarity.
Authors
- H. Aghabozorgi (ORCID: https://orcid.org/0000-0002-4990-9528)
- Šárka Hošková-Mayerová (ORCID: https://orcid.org/0000-0002-3305-529X)
- M. Jafarpour (ORCID: https://orcid.org/0000-0003-1847-0425)
- S. Shamsadini
Institutions
- Vali Asr University of Rafsanjan (IR)
- University of Defence (CZ)
Publication Details
- Journal
- Analele Universităţii "Ovidius" Constanţa. Seria Matematică
- Published
- 2025-10-01
- DOI
- https://doi.org/10.2478/auom-2025-0033
- Primary Topic
- Fuzzy and Soft Set Theory
- Type
- article
- Field-Weighted Citation Impact
- 0.00