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.