Work

Extension of Paul Erdős graph on hypergroups

Year: 2025
Type: article
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.
Language: English
Open Access status: diamond
OpenAlex ID: W4417420646
FWCI:
Cites: 16
Cited by:
Related to: