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 AU = {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.
Language: English
Page range: 145 - 164
Submitted on: Jan 23, 2025
Accepted on: Jun 14, 2025
Published on: Nov 29, 2025
Published by: Ovidius University of Constanta
In partnership with: Paradigm Publishing Services
Publication frequency: 3 issues per year
Keywords:
Related subjects:
© 2025 S. Shamsadini, H. Aghabozorgi, M. Jafarpour, S. Hoskova-Mayerova, published by Ovidius University of Constanta
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.