Hyperideal-based Intersection Graphs

The purpose of this paper is to introduce the notion of intersection graphs based on non-trivial hyperideals in general hyperrings. In order to realise the article’s goals, we design general hyperrings on any given ring and compute the set of all hyperideals of related general hyperring. Moreover to establish of connection between of hyperideals as vertices of it’s associated graph, we introduce the concept of absorbing elements. The main method in this research is based on nonempty intersection of hyperideals, so we discuss on divisor of order of general hyperrings. As a result of the research, is constructing of some necessary and sufficient conditions in intersection graphs to be a connected( complete, Hamiltonian, or Eulerian) graph. Also, is presented notations of annihilator and kernel of homomorphisms via absorbing elements and fundamental relations. The paper includes implications for the development of intersection graph, for modelling the complex hypernetworks by absorbing elements, prime divisors and their relations in hyperideals. The new conception of intersection graphs based on hyperideals of general hyperrings was broached for the in this paper first time.