Abstract
In this paper, first, we state an operator on an ordered semihyperring R. We show that if is a monomorphism and , then . Afterward, hyperatom elements in ordered semihyperrings are defined and some results in this respect are investigated. Denote by the set of all hyperatoms of R. We prove that if R is a finite ordered semihyperring and , then for any , there exists such that . Finally, we study the -graph of an ordered semihyperring and give some examples. Furthermore, we show that if is an isomorphism, G is the -graph of R and is the -graph of T, then .
MSC:
16Y99
1. Introduction and Preliminaries
The concept of the hypergroup was introduced by Marty [1] in 1934. The notion of semihyperring was introduced by Vougiouklis [2] as a generalization of semiring in 1990. The study of ordered semihypergroups is one interesting topic in hyperstructure theory. The notion of ordered semihypergroup was proposed by Heidari and Davvaz [3] in 2011. Recently, Shi et al. [4] also pioneered the notion of factorizable ordered hypergroupoids with applications. After the paper [3] was published, many authors obtained some results on ordered semihypergroups. Davvaz et al. in [5] initiated the study of pseudoorders in ordered semihypergroups. Gu and Tang in [6] and Tang et al. in [7] constructed the ordered semihypergroup from an ordered semihypergroup by using ordered regular equivalence relation.
A study on k-bi-quasi hyperideals in an ordered semihyperring is done in [8]. In [9], uni-soft interior -hyperideals in ordered -semihypergroups are studied. In [10], Hila et al. investigated -absorbing hyperideals in Krasner -hyperrings. The derivations of hyperrings [11]; the w-pseudo-orders [12]; the ordered regular equivalence relations [13]; the relative bi-(int-)-hyperideals [14] and the A---hyperideals [15], have been introduced and studied. Some recent studies on ordered semihyperring theory are on derivations done by Rao et al. in [16] and Kou et al. in [17].
In 2019, Panganduyon and Canoy [18] defined zero divisor graph of a hyper BCI-algebra and discussed some of its properties. In 2021, Panganduyon et al. [19] investigated some properties of the induced topology on certain hyper BCI-algebras. Many properties of hyperatom elements were extended to hyper BCK-algebras in [20,21]. We invite the readers to [22,23] to see more about the graph theory.
A physical example of hyperstructures associated with the leptons is provided in [24]. Leptons and gauge bosons along with the interactions between their members construct an -structure [25]. Farshi et al. [26] explored some connections between graph theory and hyperstructure theory in 2014. Now, we analyze an operator on an ordered semihyperring R and investigae some aspects of -graph.
A mapping is called a hyperoperation on R. If and , then
is called a semihypergroup if for every in R,
A triple is a semihyperring [2] if ⊕ and ⊙ are both hyperoperations such that
- (1)
- is a commutative semihypergroup;
- (2)
- is a semihypergroup;
- (3)
- for all in R, and .
If there exists 0 in R such that and for all u in R; then 0 is called the zero element of R.
Definition 1.
[13,16] Take a semihyperring and a partial order relation ≤. Then is called an ordered semihyperring if for any ,
For every , is defined by such that . Clearly, implies , but the converse is not valid in general. Also, R is said to be positive if for all .
Let and be two ordered semihyperrings. We will say that a function is a homomorphism of ordered semihyperrings if for all ,
- (1)
- ,
- (2)
- ,
- (3)
- implies .
We will say that is a left (resp. right) hyperideal of R if
- (1)
- for all , ;
- (2)
- (resp. );
- (3)
- .
The set is given by
2. Main Results
In this section, for the first time, we study the operator in ordered semihyperrings and present some results in this respect. Moreover, we introduce hyperatom elements in ordered semihyperrings and investigate some of their properties.
Let be an ordered semihyperring and . The set is given by
For , we write instead of . For , we have that
- (1)
- ;
- (2)
- for all ;
- (3)
- ;
- (4)
- If , then .
Furthermore, in a positive ordered semihyperring R, .
Remark 1.
Let be an ordered semihyperring and . Then Indeed: Let . Then . So, and hence . Thus,
Proposition 1.
Let be an ordered semihyperring and . Then
Proof.
Let . Then for all . By Definition of , we have for all . Since ≤ is transitive, we get for all . So, . □
Theorem 1.
Consider as the monomorphism. If , then .
Proof.
Let . We get
Hence, . □
Definition 2.
We say that an element x of an ordered semihyperring is a hyperatom element if
- (1)
- for any , implies or ;
- (2)
- implies for some .
Remark 2.
Consider the ordered semihyperring . Then R is hyperatomic if and only if or for any .
Theorem 2.
Let be an ordered semihyperring such that . We denote by the set if all hyperatom elements of R. If , then or ∅.
Proof.
Let . Consider the following situations.
Case 1. for all .
Since , we get for all . Thus, .
Case 2. for all .
Then, . By Remark 2, we have or . Hence, or ∅. □
Theorem 3.
Let be a finite ordered semihyperring. Then, for any , there exists such that , where .
Proof.
Let . Consider the following situations.
Case 1.q is a hyperatom.
Then take .
Case 2.q is not a hyperatom.
Then, there exists such that .
Subcase 1. is a hyperatom.
Then take .
Subcase 2. is not a hyperatom.
Then, there exists such that . Since R is finite, we have
where . So, if or and . □
Corollary 1.
Let be a finite ordered semihyperring. Then there exists such that for any , where if and only if .
Proof.
Necessity. Take any . By hypothesis, there exists such that . Since m is a hyperatom element and , we get . So, .
Sufficiency. Let and . By Theorem 3, we have . □
Definition 3.
The -graph G of a finite ordered semihyperring R is the graph whose vertex set and edge set satisfying the following condition:
Example 1.
Consider the ordered semihyperring , where ⊕ is a symmetrical hyperoperation (as shown in Table 1 and Table 2):
Table 1.
Table of ⊕ for Example 1.
Table 1.
Table of ⊕ for Example 1.
| ⊕ | 0 | a | b | c |
| 0 | 0 | a | b | c |
| a | a | {a, b} | b | c |
| b | b | b | { 0, b } | c |
| c | c | c | c | { 0, c } |
Table 2.
Table of ⊙ for Example 1.
Table 2.
Table of ⊙ for Example 1.
| ⊙ | 0 | a | b | c |
| 0 | 0 | 0 | 0 | 0 |
| a | 0 | a | a | a |
| b | 0 | b | b | b |
| c | 0 | c | c | c |
Then
and
The -graph G of R is shown in Figure 1:
Figure 1.
-graph for Example 1.
Clearly, G is a connected graph.
The -graph of an ordered semihyperring is not connected in general. The following example validates it.
Example 2.
Consider the ordered semihyperring , where ⊕ is a symmetrical hyperoperation (see Table 3 and Table 4):
Table 3.
Table of ⊕ for Example 2.
Table 3.
Table of ⊕ for Example 2.
| ⊕ | 0 | a | b | c |
| 0 | 0 | a | b | c |
| a | a | a | a | a |
| b | b | a | { 0, b } | { 0, b, c } |
| c | c | a | { 0, b, c } | { 0, c } |
Table 4.
Table of ⊙ for Example 2.
Table 4.
Table of ⊙ for Example 2.
| ⊙ | 0 | a | b | c |
| 0 | 0 | 0 | 0 | 0 |
| a | 0 | a | { 0, b } | 0 |
| b | 0 | 0 | 0 | 0 |
| c | 0 | { 0, c } | 0 | 0 |
Then
and
The -graph G of R is shown in Figure 2:
Figure 2.
-graph for Example 2.
Clearly, G is a disconnected graph.
Theorem 4.
Let be a positive ordered semihyperring. If for all , then .
Proof.
Let for all and . Since R is positive, we get
So,
It means that . Hence, for all . □
Corollary 2.
Let G be the -graph of a positive ordered semihyperring R. If for all , then for all .
Theorem 5.
Let φ be an isomorphism from an ordered semihyperring R into an ordered semihyperring T. If G is the -graph of R and is the -graph of T, then .
Proof.
Consider as the isomorphism. We have and . So, By hypothesis, there exists a one-to-one correspondence between and . On the other hand,
By Theorem 1, we get
Thus,
Hence,
So, G ≅ G′. □
3. Conclusions
In this study, we have looked into the idea of hyperatom elements on an ordered semihyperring. Moreover, we introduced an operator on an ordered semihyperring R and investigated some aspects of -graph. Furthermore, we have proved that if is an isomorphism from an ordered semihyperring R into an ordered semihyperring T, G is the -graph of R and is the -graph of T, then . In the future, we will intend to study hyperatom elements of ordered semihypergroups.
Author Contributions
Z.K. contributed to supervision, methodology, project administration, and formal analyzing. M.G. and K.H. contributed to investigation, resources, computations, and wrote the initial draft of the paper, which was investigated and approved by N.A., who wrote the final draft. All authors have read and agreed to the published version of the manuscript.
Funding
This research received no external funding.
Data Availability Statement
Not applicable.
Conflicts of Interest
The authors declare no conflict of interest.
References
- Marty, F. Sur une Generalization de la Notion de Groupe; University of Primorska: Stockholm, Sweden, 1934; pp. 45–49. [Google Scholar]
- Vougiouklis, T. On some representations of hypergroups. Ann. Sci. Univ. Clermont-Ferrand II Math. 1990, 26, 21–29. [Google Scholar]
- Heidari, D.; Davvaz, B. On ordered hyperstructures. Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys. 2011, 73, 85–96. [Google Scholar]
- Shi, X.; Guan, H.; Akhoundi, M.; Omidi, S. Factorizable ordered hypergroupoids with applications. Math. Probl. Eng. 2021, 2021, 5. [Google Scholar] [CrossRef]
- Davvaz, B.; Corsini, P.; Changphas, T. Relationship between ordered semihypergroups and ordered semigroups by using pseudoorder. Eur. J. Combin. 2015, 44, 208–217. [Google Scholar] [CrossRef]
- Gu, Z.; Tang, X. Ordered regular equivalence relations on ordered semihypergroups. J. Algebra 2016, 450, 384–397. [Google Scholar] [CrossRef]
- Tang, J.; Feng, X.; Davvaz, B.; Xie, X.Y. A further study on ordered regular equivalence relations in ordered semihypergroups. Open Math. 2018, 16, 168–184. [Google Scholar] [CrossRef]
- Rao, Y.; Xu, P.; Shao, Z.; Kosari, S. Left k-bi-quasi hyperideals in ordered semihyperrings. Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys. 2021, 83, 125–134. [Google Scholar]
- Khan, A.; Farooq, M.; Yaqoob, N. Uni-soft structures applied to ordered Γ-semihypergroups. Proc. Natl. Acad. Sci. USA 2020, 90, 457–465. [Google Scholar] [CrossRef]
- Hila, K.; Naka, K.; Davvaz, B. On (k,n)-absorbing hyperideals in Krasner (m,n)-hyperrings. Q. J. Math. 2018, 69, 1035–1046. [Google Scholar] [CrossRef]
- Asokkumar, A. Derivations in hyperrings and prime hyperrings. Iran. J. Math. Sci. Inform. 2013, 8, 1–13. [Google Scholar]
- Qiang, X.; Guan, H.; Rashmanlou, H. A note on the w-pseudo-orders in ordered (semi)hyperrings. Symmetry 2021, 13, 2371. [Google Scholar] [CrossRef]
- Omidi, S.; Davvaz, B. Construction of ordered regular equivalence relations on ordered semihyperrings. Honam Math. J. 2018, 40, 601–610. [Google Scholar]
- Rao, Y.; Xu, P.; Shao, Z.; Kosari, S.; Omidi, S. Some properties of relative bi-(int-)Γ-hyperideals in ordered Γ-semihypergroups. Front. Phys. 2020, 8, 555573. [Google Scholar] [CrossRef]
- Rao, Y.; Kosari, S.; Shao, Z.; Akhoundi, M.; Omidi, S. A study on A-I-Γ-hyperideals and (m,n)-Γ-hyperfilters in ordered Γ-Semihypergroups. Discrete Dyn. Nat. Soc. 2021, 2021, 10. [Google Scholar] [CrossRef]
- Rao, Y.; Kosari, S.; Shao, Z.; Omidi, S. Some properties of derivations and m-k-hyperideals in ordered semihyperrings. Politehn. Univ. Bucharest Sci. Bull. Ser. A Appl. Math. Phys. 2021, 83, 87–96. [Google Scholar]
- Kou, Z.; Kosari, S.; Monemrad, M.; Akhoundi, M.; Omidi, S. A note on the connection between ordered semihyperrings. Symmetry 2021, 13, 2035. [Google Scholar] [CrossRef]
- Panganduyon, M.; Canoy, S.R., Jr. On a graph induced by a hyper BCI-algebra. Eur. J. Pure Appl. Math 2019, 12, 146–158. [Google Scholar] [CrossRef]
- Panganduyon, M.; Canoy, S.R., Jr.; Davvaz, B. A topology on a hyper BCI-algebra generated by a hyper-order. Eur. J. Pure Appl. Math 2021, 14, 590–600. [Google Scholar] [CrossRef]
- Harizavi, H. On direct sum of branches in hyper BCK-algebras. Iran. J. Math. Sci. Inform. 2016, 11, 43–55. [Google Scholar]
- Jun, Y.B.; Xin, X.L. Scalar elements and hyperatoms of hyper BCK-algebras. Sci. Math. 1999, 2, 303–309. [Google Scholar]
- Bondy, J.A.; Murty, U.S.R. Graph Theory with Applications; The Macmillan Press Ltd.: London, UK, 1976. [Google Scholar]
- West, D.B. Introduction to Graph Theory; Prentice-Hall, Inc.: Hoboken, NJ, USA, 1996; p. 2001. [Google Scholar]
- Nezhad, A.D.; Nejad, S.M.M.; Nadjafikhah, M.; Davvaz, B. A physical example of algebraic hyperstructures: Leptons. Indian J. Phys. 2021, 86, 1027–1032. [Google Scholar] [CrossRef]
- Davvaz, B.; Nezhad, A.D.; Nejad, S.M.M. Algebraic hyperstructure of observable elementary particles including the Higgs boson. Proc. Natl. Acad. Sci. USA 2020, 90, 169–176. [Google Scholar] [CrossRef]
- Farshi, M.; Davvaz, B.; Mirvakili, S. Degree hypergroupoids associated with hypergraphs. Filomat 2014, 28, 119–129. [Google Scholar] [CrossRef][Green Version]
Publisher’s Note: MDPI stays neutral with regard to jurisdictional claims in published maps and institutional affiliations. |
© 2022 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).