Semihypergroup-Based Graph for Modeling International Spread of COVID-n in Social Systems

Abstract

Graph theoretic techniques have been widely applied to model many types of links in social systems. Also, algebraic hypercompositional structure theory has demonstrated its systematic application in some problems. Influenced by these mathematical notions, a novel semihypergroup-based graph (SBG) of $G=⟨H,E⟩$ is constructed through the fundamental relation ${\gamma }_n$ on $H,$ where semihypergroup H is appointed as the set of vertices and E is addressed as the set of edges on SBG. Indeed, two arbitrary vertices x and y are adjacent if $x{\gamma }_{n}y.$ The connectivity of graph G is characterized by $x{\gamma }^{*}y,$ whereby the connected components SBG of G would be exactly the elements of the fundamental group $H/{\gamma }^{*}.$ Based on SBG, some fundamental characteristics of the graph such as complete, regular, Eulerian, isomorphism, and Cartesian products are discussed along with illustrative examples to clarify the relevance between semihypergroup H and its corresponding graph. Furthermore, the notions of geometric space, block, polygonal, and connected components are introduced in terms of the developed SBG. To formulate the links among individuals/countries in the wake of the COVID (coronavirus disease) pandemic, a theoretical SBG methodology is presented to analyze and simplify such social systems. Finally, the developed SBG is used to model the trend diffusion of the viral disease COVID-n in social systems (i.e., countries and individuals).

1. Introduction

Graph theory with its systematic structure is applied to different complicated problems such as physical, biological, and social systems. By employing graph theory, social network structures can be modeled and analyzed to provide simplified knowledge of such systems, where nodes (vertices) are users and lines (edges) are the links among users. Graph theory was first proposed by Euler to solve Konigsberg’s seven-bridge problem [1]. After that, he established a novel graph structure called an Eulerian graph [2]. The concepts of a complete graph [3] and a bipartite graph was defined along with tree structure and coloring problems [4]. With the integration of graph theory and fuzzy set theory, the notion of fuzzy graph theory was proposed by Kaufmann. Then, this theory was developed by Rosenfeld, where fuzzy relations on fuzzy sets were introduced to improve graph-theoretic concepts (e.g., bridges and trees) [5]. To eliminate new problems in science, especially combinatorics, hypergraph theory was initiated and formulated by Berge [6] as the generalization of graph theory, where the edges are arbitrary subsets of the vertices to effectively analyze and simplify complex relations in various spectra for real-world problems [7].

Algebraic hypercompositional structure theory, with its dynamic multi-valued systems, is enumerated as the extension of a classical algebraic structure. Marty introduced a hyperoperation (hypercomposition) on a nonvoid set $H,$ which is a map from $H\times H$ to the power set $P\left(H\right)$ of $H,$ such that with associative property and reproductivity, H would be hypergroup [8]. Then, the hypercompositional structure theory was improved in terms of theory and applications by Corsini et al. [9]. Freni determined a novel characterization of the derived hypergroup via strongly regular equivalence relation $\gamma$ on a hypergroup $H,$ and a binary operation on the quotient set $H/{\gamma }^{*}$ so that $H/{\gamma }^{*}$ is a group with relation ${\gamma }^{*}$ as a fundamental relation (${\gamma }^{*}$ is the transitive closure of $\gamma$ and $H/{\gamma }^{*}$ is the fundamental group) [10,11]. Indeed, a fundamental relation is a powerful gadget for the derivation of universal algebra (group, ring, module, etc.) on algebraic hypercompositional structures as well as fuzzy algebraic hypercompositional structures. The present authors studied and formulated the fundamental relations on the fuzzy hypergroup, fuzzy hyperring, and fuzzy hypermodule, where their fundamental relations have the smallest equivalence relation resulting in their quotients being a group, ring, and module, respectively, [12,13,14]. In other studies, they appointed the fundamental functor between the category of fuzzy hyperrings (hypermodules) and the category of rings (modules) [15,16].

The relevance between graphs/hypergraphs and hypergroups has been investigated by many scholars such as Corsini [17] and Leoreanu [18]. Farshi et al. studied hypergroups associated with hypergraphs and established a $\rho$-hypergroup with a given hypergraph by describing a relation $\rho$ which resulted in the fundamental relation of an $\rho$-hypergroup [19]. Kalampakas et al. surveyed path hypergroupoids, especially commutativity and graph connectivity, along with the directed graph isomorphism classes of C-hypergroupoids [20]. Nikkhah et al. developed hypergroups constructed from hypergraphs using a hyperoperation upon the set of vertice degrees of a hypergraph, where the established hypergroupoid is $H_v$-group [21]. Recently, the present authors proposed a Caley graph related to a semihypergroup (hypergroup) with some important features including the category of Cayley graphs and a functor with an application in social networks [22].

With dynamic and potential applications of graph theory in various fields of science, i.e., computer science, linguistics, physics, chemistry, social sciences, biology, mathematics, bioinformatics, etc., many studies have been conducted [23]. For example, Savinkov et al. analyzed and modeled human lymphatic systems via graph theory [24]. The systematic converter derivation/modeling and advanced control in an emerging/challenging power electronics converter was simulated by graph theory as a powerful mathematical structure [25]. Park et al. indicated important insights from complex travel mobility networks with graph-based spatiotemporal analytics [26]. In another work, an effective transductive learning technique was proposed by employing variational nonlocal graph theory for hyperspectral image classification [27]. Recently, the authors presented a soft hypergraph as the generalization of graph theory with the pragmatic application for modeling global interactions in social media networks [28].

The COVID-19 (coronavirus disease 2019) pandemic is considered the most fatal global health catastrophe to date with its serious negative and destructive impact on human life, i.e., social, economical, and environmental challenges. After its detection, the virus extended globally and caused innumerable death. At present, there is no definitive treatment of clinical antiviral drugs or vaccines against the virus [29]. Almost whole nations attempted to decline the transition of the disease via examination and treating patients, quarantining suspected persons through contact tracing, limiting large gatherings, maintaining complete or partial lockdowns, etc. The impact of COVID-19 on various societies and useful ways for controlling viral disease were investigated in [30].

The principal objective of this study is to establish a novel framework of a graph called SBG using a specific relation of algebraic hypercompositional structures in the context of social systems, i.e., the spread trend of the coronavirus disease among societies and individuals. After the Introduction and the Preliminary sections, in Section 3, we appoint a neoteric graph $G=〈H,E〉$ by applying a fundamental relation ${\gamma }^{*}$ on a semihypergroup $H.$ The elements of H are vertices and two vertices x and y are adjacent if $x{\gamma }_{n}y,$ that is, they are considered edges. The connectivity SBG of G is defined as $x{\gamma }^{*}y,$ where the connected components of G are precisely the elements of the fundamental group $H/{\gamma }^{*}.$ Certain fundamental properties of graph theory such as complete, regular, Eulerian, isomorphism, and Cartesian products are proposed. In addition, elucidatory examples are applied to demonstrate the relationship between semihypergroup (hypergroup) H and its associated graph. The mathematical notions of geometric space, block, polygonal, and connected components are discussed. In the end, in Section 4, the developed SBG is utilized to model the global outbreak of COVID-n in social systems (i.e., individuals as well as countries) (Figure 1).

2. Preliminaries

Definition 1. 

A hypergroupoid $(L,\diamond )$ is a nonvoid set L with a hyperoperation $\diamond ,$ which is a map $\diamond :L\times L\to P^{*}\left(L\right),$ where $P^{*}\left(L\right)$ implies the family of all nonvoid subsets of L [9]. Denote $c\diamond d$ as the hyperproduct of c and d for every $c,d\in L.$ A hypergroupoid $(L,\diamond )$ is described as a semihypergroup if L has associative property, i.e., $(c\diamond d)\diamond e=c\diamond (d\diamond e)$ for all $c,d,e\in L.$ A hypergroup is a semihypergroup along with reproductivity axiom, that is $e\diamond L=L\diamond e=L$ for all $e\in L.$ A hypergroupoid $(L,\diamond )$ is called quasihypergroup if the reproductivity property holds. The hypergroup is commutative if $e\diamond f=f\diamond e$ for all $e,f\in L.$ A nonvoid subset M of a hypergroup L is a subhypergroup of L if $z\diamond M=M\diamond z=M$ for every $z\in M.$

Assume E and F are nonvoid subsets of $L,$ hence $E\diamond F={\bigcup }_{e\in E,f\in F}e\diamond f.$ Moreover, $l\in L$ and $E\subseteq L,$ we have $l\diamond E={\bigcup }_{e\in E}l\diamond e.$ If associativity holds, then we denote the hyperproduct of elements $x_1,\dots ,x_n$ of L by ${\prod }_{i=1}^n{x}_i:=x_1\diamond x_2\diamond \dots \diamond x_n$.

Suppose that $(L,\diamond )$ and $(L^{\prime },{\diamond }^{\prime })$ are two hypergroups. A map $\psi :L⟶L^{\prime }$ is determined as a homomorphism if $\psi (k\diamond l)=\psi \left(k\right){\diamond }^{\prime }\psi \left(l\right)$ for all $k,l\in L.$ Furthermore, ψ is named an isomorphism if it is one to one and onto homomorphism written by $L\cong L^{\prime }.$

The following Definition 2, Proposition 1, Theorem 1, Proposition 2, and Theorem 2 are taken from [31].

Definition 2. 

Assume that L is a nonvoid set and σ is a binary relation on $L.$ Consider the following hypercomposition “∘” on L as:

$$x\circ y=\{z\in L:(x,z)\in \sigma ,(z,y)\in \sigma \}$$

(1)

$(L,\circ )$ is a hypergroupoid provided there exists $z\in L$ so that $(x,z)\in \sigma$ and $(z,y)\in \sigma$ for every couple of elements $x,y\in L.$

Denote the hypercompositional structure in Equation (1) by $L_{\sigma }.$ The reproductivity property in $L_{\sigma }$ is satisfied if and only if $(x,y)\in \sigma$ for all $x,y\in L_{\sigma }.$

Proposition 1. 

•

$L_{\sigma }$ is a quasihypergroup if and only if $(x,y)\in \sigma$ for all $x,y\in L_{\sigma }.$

•

$L_{\sigma }$ is a semihypergroup if and only if $(x,y)\in \sigma$ for all $x,y\in L_{\sigma }.$

Theorem 1. 

Let σ be a binary relation on the nonvoid set $L.$ Then, the hypercomposition $x\circ y$ satisfies the reproductivity or associativity only when $L_{\sigma }$ is total (i.e., $x\circ y=L_{\sigma }$).

Each relation $\sigma$ on finite set $L=\{a_1,a_2,\dots ,a_n\}$ can be represented through a Boolean matrix $M_{\sigma }$ with $n\times n$ elements. The Boolean matrix $M_{\sigma }=\left(m_{ij}\right)$ is defined as follows:

$$m_{ij}=\left\{\begin{array}{cc}1,& if(a_i,a_j)\in \sigma \\ 0,& otherwise\end{array}\right.$$

In Boolean algebra, we have

$$\begin{array}{cc}\hfill & 0+1=1+0=1+1=1,0+0=0\hfill \\ \hfill & 0.0=0.1=1.0=0,1.1=1\hfill \end{array}$$

$L_{\sigma }$ is hypergroupoid if and only if $M_{\sigma }^2=S,$ where $S=\left(s_{ij}\right)$ with $s_{ij}=1$ for all $i,j.$

Proposition 2. 

•

$L_{\sigma }$ is a quasihypergroup if and only if $M_{\sigma }=S.$

•

$L_{\sigma }$ is a semihypergroup if and only if $M_{\sigma }=S.$

Theorem 2. 

The only relation σ which results in a quasihypergroup or semihypergroup is the one with $M_{\sigma }=S.$ Additionally, $L_{\sigma }$ is the total hypergroup.

It was revealed that with a few lines of the Mathematica program, the results were constructed for the enumeration of the hypergroupoid associated with binary relations of orders 2, 3, 4, and 5 by a significantly simpler procedure [31].

Definition 3. 

A graph G is a pair $G=(V,E),$ where V is a set of elements described as vertices and E is a set of edges [32]. The two vertices associated with an edge are called endpoints. If x = y, then the edge is considered as a loop. A vertex is isolated if it is incident with no edges. The graph G is simple if it has no loops and no two distinct edges have the same pair of ends. The graph G is called null graph when its edges set is empty. Graph H is named a subgraph of graph G if $V\left(H\right)\subseteq V\left(G\right),E\left(H\right)\subseteq E\left(G\right),$ and the ends of an edge $e\in E\left(H\right)$ are the same as its ends in $G.$ Denote $d\left(x\right)$ as the degree of vertex x as well as the number of edges incident with $x.$

A path in graph G consists of a sequence $x_1,e_1,x_2,e_2,\dots ,e_k,x_k$ that the edges $e_i$ are distinct. Furthermore, if $x_1=x_k$ then, we call the path a cycle. Consider that $d(x,y)$ is the length of the shortest path between two vertices x and $y.$ Note that $diam\left(G\right)=sup\left\{d\right(a,b\left)\right\}$ for all a and b that are vertices of $G,$ which is called the diameter of graph $G.$ The graph G is connected if there exists a path from vertex x to vertex $y,$ or graph G includes several connected components. A tree is a connected graph that includes no simple cyclic path. Denote $k_n$ as a complete graph, where every pair of vertices is adjacent. An Eulerian circuit is a closed path through a graph applying each edge once and an Eulerian graph is a graph that has this property. Furthermore, graph G is called a Hamiltonian graph if it has a cycle that passes each vertex exactly once. If every vertex has the same degree, the graph is regular, or k-regular if $\forall x\in V,d\left(x\right)=k.$

Theorem 3. 

A finite graph G without isolated vertices is Eulerian if and only if G is connected and each vertex has an even degree [32].

Definition 4. 

The Cartesian product of two graphs $G_1=〈V_1,E_1〉$ and $G_2=〈V_2,E_2〉$ is denoted by $G_1\square G_2,$ that is a graph with vertices set $V_1\times V_2,$ where vertices $(t_1,t_2),(w_1,w_2)$ are adjacent if and only if $t_1=w_1,(t_2,w_2)\in E_2$ or $t_2=w_2,(t_1,w_1)\in E_1$ for $t_1,w_1\in V_1,t_2,w_2\in V_2$ [33].

3. Semihypergroup-Based Graph (SBG) Based on Relation γ

Consider an SBG of $G=〈H;E={\left({\gamma }_n\right)}_{n\in \mathbb{N}}〉,$ where $(H,\circ )$ is a semihypergroup and ${\gamma }_n$ is the relation on $H.$ The order of G is $o\left(G\right)=\mid H\mid .$ The elements of H are represented as vertices and the relations ${\gamma }_n$ are appointed as edges. We assign x and y to be adjacent, if $x{\gamma }_{n}y.$ Clearly, for $n=1$ and $x{\gamma }_{1}x,$ the edge is a loop.

Indeed, ${\gamma }_n$ was determined in [10] as follows:

$$x{\gamma }_{n}y⟺\exists (a_1,\dots ,a_n)\in H^n,\exists \sigma \in S_n:x\in \prod _{i=1}^n{a}_i,y\in \prod _{i=1}^n{a}_{\sigma \left(i\right)}$$

(2)

Consider ${\gamma }_1=\{(a,a)\mid a\in H\}.$ Clearly, the relations ${\gamma }_n$ have symmetric property and relation $\gamma$ has a reflexive and symmetric property for every $n\in \mathbb{N},$ where $\gamma ={\bigcup }_{n\ge 1}{\gamma }_n.$ Let ${\gamma }^{*}$ be the transitive closure of $\gamma .$ The class of $H/{\gamma }^{*}$ was addressed as ${\gamma }^{*}\left(z\right)=\{w\mid z{\gamma }^{*}w\},$ for $z,w\in H.$ It was proven that for hypergroup $H,$ the relation $\gamma$ is transitive and ${\gamma }^{*}$ has the smallest strongly regular equivalence property that results $H/{\gamma }^{*}$ is an Abelian group (fundamental group).

Theorem 4. 

Assume that H is a hypergroup. Then, for an SBG of $G=〈H;E={\left({\gamma }_n\right)}_{n\in \mathbb{N}}〉,$ the following statements hold:

(i) 

A path exists between two vertices x and y of G if and only if $x{\gamma }^{*}y.$

(ii) 

The SBG of G is connected if and only if the fundamental group $H/{\gamma }^{*}$ is a singleton, that is $\mid H/{\gamma }^{*}\mid =1.$

Proof. 

Proof of (i): Consider a path from vertex x to vertex $y.$ Then, there exists a sequence $(a_1,\dots ,a_k)\in H^k$ so that $x=a_1{\gamma }_1{a}_2\dots {\gamma }_k{a}_k=y,$ that is equal to $x{\gamma }^{*}y.$ Conversely, if $x{\gamma }^{*}y,$ then $\exists (a_1,\dots ,a_k)\in H^k$ such that $x=a_1{\gamma }_1{a}_2\dots {\gamma }_k{a}_k=y.$ Therefore, there exists a path from vertex x to vertex $y.$

Proof of (ii): By applying (i), for $x,y\in H,$ a path exists from vertex x to vertex y if and only if $x{\gamma }^{*}y.$ Therefore, the SBG of G is a connected graph if and only if ${\gamma }^{*}=H\times H$ (i.e., clearly, ${\gamma }^{*}\subseteq H\times H.$ Furthermore, for all $x,y\in H,$ since $(x,y)\in {\gamma }^{*},$ then $H\times H\subseteq {\gamma }^{*}$). Since $x{\gamma }^{*}y,$ we have ${\gamma }^{*}\left(x\right)={\gamma }^{*}\left(y\right)$ which means that the fundamental group $H/{\gamma }^{*}=\{{\gamma }^{*}\left(x\right)\mid x\in H\}$ is a singleton, i.e., $\mid H/{\gamma }^{*}\mid =1.$ □

Theorem 5. 

The connected components SBG of G are precisely the elements of the fundamental group $H/{\gamma }^{*}.$

Proof. 

Let $x,y$ be two vertices SBG of $G.$ By employing Theorem 4, vertex x is connected to vertex y if and only if $x{\gamma }^{*}y.$ Then, for all $a\in H,$ every element of ${\gamma }^{*}\left(a\right)$ is connected. With the equivalence relation of ${\gamma }^{*},$ the elements of $H/{\gamma }^{*}$ would be the connected components SBG of $G.$ □

Theorem 6. 

Let H be a semihypergroup. If the SBG of $G=〈H,E〉$ is complete, then the relation γ is transitive.

Proof. 

Let $x\gamma y$ and $y\gamma z.$ For some $n_1,n_2\in \mathbb{N},$ we have $x{\gamma }_{n_1}y$ and $y{\gamma }_{n_2}z.$ Since the SBG of G is complete, therefore, for some $n\in \mathbb{N},$ we have $x{\gamma }_{n}z$ that yields $x\gamma z.$ □

Remark 1. 

Note that a loop is not considered an edge. If $x\gamma x,$ then for every $a_i\in H,\exists \sigma \in S_n$ we have $x\in {\prod }_{i=1}^n{a}_i$ and $x\in {\prod }_{i=1}^n{a}_{\sigma \left(i\right)}.$ Hence, ${\prod }_{i=1}^n{a}_i={\prod }_{i=1}^n{a}_{\sigma \left(i\right)}.$

Definition 5. 

Let H be a nonvoid set and let ${\gamma }^{*}$ be the defined relation in Equation (2). Consider the hypercomposition “⊙” on H as follows:

$$x\odot y=\{w\in H:(x,w)\in {\gamma }^{*},(w,y)\in {\gamma }^{*}\}$$

(3)

We denote the hypercompositional structure $(H,\odot )$ by $H_{{\gamma }^{*}}.$ The $H_{{\gamma }^{*}}$ is a hypergroupoid if $\exists w\in H$ so that $(x,w)\in {\gamma }^{*}$ and $(w,y)\in {\gamma }^{*}$ for every $x,y\in H.$ Since ${\gamma }^{*}$ is transitive, we have $(x,y)\in {\gamma }^{*}$ for all $x,y\in H_{{\gamma }^{*}},$ then the reproductivity property holds. In fact, for the arbitrary element $x\in H_{{\gamma }^{*}},$ the reproductivity axiom $y\in x\odot H_{{\gamma }^{*}}$ holds for all $y\in H_{{\gamma }^{*}},$ as per the transitive property of ${\gamma }^{*}.$

Proposition 3. 

(i) 

$H_{{\gamma }^{*}}$ is a semihypergroup if and only if $(x,y)\in {\gamma }^{*}$ for all $x,y\in H_{{\gamma }^{*}}.$

(ii) 

$H_{{\gamma }^{*}}$ is a quasihypergroup if and only if $(x,y)\in {\gamma }^{*}$ for all $x,y\in H_{{\gamma }^{*}}.$

(iii) 

The SBG of $G=〈H_{{\gamma }^{*}},E〉$ is a connected graph if and only if $(x,y)\in {\gamma }^{*}$ for all $x,y\in H_{{\gamma }^{*}}.$

(iv) 

The SBG of $G=〈H_{{\gamma }^{*}},E〉$ is a complete graph if and only if $H_{{\gamma }^{*}}$ is total, i.e., $x\odot y=H_{{\gamma }^{*}}$ for all $x,y\in H_{{\gamma }^{*}}.$

Proof. 

Proof of (i): It is derived by applying Proposition 1.

Proof of (ii): With the validity of the reproductivity property, the statement is proven.

Proof of (iii): Since $H_{{\gamma }^{*}}$ is a quasihypergroup and considering part (i), we have $H_{{\gamma }^{*}}$ as a hypergroup. By Theorem 4, we have $x{\gamma }^{*}y$ for all $x,y\in H_{{\gamma }^{*}}$ if and only if the SBG of G is connected.

Proof of (iv): The statement is attained from Equation (3). □

Example 1. 

Consider $(H,\circ )$ as a semihypergroup that is given in

Table 1. Semihypergroup (H, ∘).

∘	0	1	2
0	0	1	2
1	1	{0,2}	1
2	2	1	{0,2}

.

It is seen that $1\in 1\circ 2,1\in 2\circ 1,$ then $1\gamma 1.$ Furthermore, we have $0\gamma 0,2\gamma 2$ and $0\gamma 2.$ The corresponding SBG of G is depicted in Figure 2. Moreover, $H/{\gamma }^{*}=\{\{0,2\},1\}$ and $\mid H/{\gamma }^{*}\mid \ne 1.$

γ is transitive and the SBG of G is not connected, because vertices 0 and 1 are not adjacent. The SBG of G is not complete, which results in the invalidity of the reverse Theorem 6.

Corollary 1. 

Let $G=〈H,E〉$ be an SBG, and let H be a semihypergroup. If the SBG of G is complete, then $H/{\gamma }^{*}$ is a singleton, and $diam\left(G\right)=1.$

Proof. 

By applying Theorems 4 and 6, the relation $\gamma$ is transitive and $H/{\gamma }^{*}$ is a singleton. Since the SBG of G is complete, then every path from vertex x to vertex y has a maximum length of $1,$ which means $diam\left(G\right)=1.$ □

Proposition 4. 

Suppose that H is a hypergroup on the SBG of $G=〈H,E〉.$ Then, the degree of vertex x in SBG of G is equal to $\mid {\gamma }^{*}\left(x\right)\mid$.

Proof. 

Let H be a hypergroup. By employing Theorem 4 and ${\gamma }^{*}\left(x\right)$ as an equivalence class of x, the results show that the number of edges incident with vertex x is equal to $\mid {\gamma }^{*}\left(x\right)\mid$. □

Corollary 2. 

Let $G=〈H,E〉$ be an SBG, and let H be a hypergroup. Assume that $\mid {\gamma }^{*}\left(x\right)\mid =k$ for all $x\in H.$ Then, the SBG of G is a k-regular graph.

Theorem 7. 

Let $H_1$ be a hypergroup on SBG of $G_1=〈H_1,E_1〉.$ Let $H_2$ be a subhypergroup of $H_1$ on SBG of $G_2=〈H_2,E_2〉.$ Then, the SBG of $G_2$ is a sub-SBG of $G_1.$

Proof. 

Assume that $H_2$ is a subhypergroup of $H_1,$ then $H_2\subset H_1.$ Therefore, the vertices SBG of $G_2$ is contained in the vertices SBG of $G_1$ and the edges $G_2$ is included in the edges of $G_1.$ Then, the SBG of $G_2$ is a sub-SBG of $G_1.$ □

Theorem 8. 

Let H be a hypergroup. The SBG of $G=〈H,E〉$ is Eulerian if and only if $\mid {\gamma }^{*}\left(z\right)\mid =2k$ for all $z\in H,k\in \mathbb{N}.$

Proof. 

Let H be a hypergroup. Then, the relation $\gamma$ is transitive [9]. By applying Theorem 4, the SBG of G is a connected graph. Additionally, with Proposition 4, $d\left(z\right)=\mid {\gamma }^{*}\left(z\right)\mid ,$ for all $z\in H$ and by Theorem 3, the proof is completed. □

Example 2. 

Let $(H,\circ )$ be a hypergroup in [34] (Example 28 (3)).

The corresponding SBG of G is shown in Figure 3, which is a connected and complete graph. Moreover, $H/{\gamma }^{*}=\left\{\{a,b,c\}\right\}$ and $\mid H/{\gamma }^{*}\mid =1.$ Additionally, $\mid {\gamma }^{*}\left(a\right)\mid =\mid {\gamma }^{*}\left(b\right)\mid =\mid {\gamma }^{*}\left(c\right)\mid =2,$ that means $d\left(a\right)=d\left(b\right)=d\left(c\right)=2.$ Furthermore, $diam\left(G\right)=1$ and the SBG of G is a 2-regular and Eulerian graph.

Definition 6. 

The SBG of G is isomorphic to the SBG of $G^{\prime },$ if there exists a bijection ϕ from the set vertices of G to the set vertices of $G^{\prime },$ such that $x{\gamma }_{G}y⟺\varphi \left(x\right){\gamma }_{G^{\prime }}\varphi \left(y\right),$ written by $G\cong G^{\prime }.$

Theorem 9. 

Let $(H_1,{\circ }_1)$ and $(H_2,{\circ }_2)$ be two isomorphic hypergroups and let $G_1$ and $G_2$ be two SBGs associated with $H_1$ and $H_2,$ respectively. Then, the SBG of $G_1$ and the SBG of $G_2$ are isomorphisms.

Proof. 

Assume $H_1$ and $H_2$ are isomorphisms. Then, $\mid H_1\mid =\mid H_2\mid$ and we have $\mid G_1\mid =\mid G_2\mid$. Furthermore, if vertex x is connected to vertex $y,$ then $x{\gamma }^{*}y$ and we have $\exists (a_1,\cdots ,a_n)\in H^n,\exists \sigma \in S_n;x\in {\prod }_{i=1}^n{a}_i,y\in {\prod }_{i=1}^n{a}_{\sigma \left(i\right)}.$ Let $\varphi :H_1⟶H_2$ be an isomorphism and let $\varphi \left(x\right)=x^{\prime },\varphi \left(y\right)=y^{\prime }$ and $\varphi \left(a_i\right)=a_i^{\prime }.$ Furthermore, $\varphi \left({\prod }_{i=1}^n{a}_i\right)={\prod }_{i=1}^n\varphi \left(a_i\right)={\prod }_{i=1}^n{a}_i^{\prime },$ which yields $x^{\prime }$ that is connected to $y^{\prime }.$ Hence, $G_1\cong G_2.$ □

Example 3. 

To show that the reverse of Theorem 9 is not satisfied, consider two hypergroups $(H,\circ )$ and $(H^{\prime },{\circ }^{\prime })$ in [34] (Example 16 (3)).

Let $f:H⟶H^{\prime }$ with $f\left(a\right)=1,f\left(b\right)=1,f\left(c\right)=2.$ Since $f(a\circ b)=f\left(H\right)=\{1,2\}$ and $f\left(a\right){\circ }^{\prime }f\left(b\right)=1\circ 1=1,$ means that f is not an isomorphism $(i.e.,f(a\circ b)\ne f\left(a\right){\circ }^{\prime }f\left(b\right)).$ The two SBGs are isomorphisms, as depicted in Figure 4.

Definition 7. 

Let $G=〈H,E〉$ and $G^{\prime }=〈H^{\prime },E^{\prime }〉$ be two SBGs, where H and $H^{\prime }$ are two hypergroups and $E=\{E_1,\dots ,E_m\}$ and $E^{\prime }=\{E_1^{\prime },\dots ,E_n^{\prime }\}.$ Define the Cartesian product $G\divideontimes G^{\prime }$ with the vertices set $H\times H^{\prime }$ and edges set $E_l\times E_k^{\prime }$ for $1\le l\le m,1\le k\le n.$

Example 4. 

Consider two SBGs in Example 3. By considering $G=〈H,E〉$ and $G^{\prime }=〈H^{\prime },E^{\prime }〉,$ the Cartesian product of two SBGs G and $G^{\prime }$ is depicted in Figure 5. The vertices of $G\divideontimes G^{\prime }$ are $H\times H^{\prime }=\{(a,0),(a,1),(a,2),(b,0),(b,1),(b,2),(c,0),(c,1),(c,2)\}$ and the corresponding edges are $E\times E^{\prime }=\{[(a,0),(b,0)],[(a,0),(a,1)],\dots ,[(a,2),(c,2)]\}.$

Proposition 5. 

Let $G=〈H,E〉$ and $G^{\prime }=〈H^{\prime },E^{\prime }〉$ be two SBGs and let $(a_1,b_1),(a_2,b_2)\in H\times H^{\prime }.$ Then,

$$(a_1,b_1){\gamma }_{G\times G^{\prime }}(a_2,b_2)⟺a_1{\gamma }_G{a}_2,b_1{\gamma }_{G^{\prime }}{b}_2.$$

Geometric Concept of SBG

A geometric space is a couple $(S,V)$ where S is a nonvoid set and V is the family of a nonvoid subset of $S.$ The elements of S are considered points and the elements of V are represented as blocks. If V covers $S,$ then a polygonal of $(S,V)$ is an n-tuple of blocks $(V_1,V_2,\dots ,V_n)$ so that $V_i\cap V_{i+1}\ne \varnothing ,$ for every $i\in \{1,2,\dots ,n-1\}.$ Introduce the relation ≈ on S as follows:

$$x\approx y⟺\exists (V_1,V_2,\dots ,V_n);x\in V_1,y\in V_n.$$

If V covers $S,$ then the relation is an equivalence relation. The equivalence class $\left[x\right]$ is determined as a connected component of x in S [10,11].

According to the SBG of G, we consider a pair $〈H,E〉$ as a geometric space of SBG, where H is a semihypergroup (set of vertices) and E is the set of relations ${\gamma }_n$ (set of edges) for $n\in \mathbb{N}$ on $H.$ For every $x,y\in H,$ we have $x{E}_{i}y⟺x{\gamma }_{n}y$ with the given relation ${\gamma }_n$ as follows:

$$x{\gamma }_{n}y⟺\exists (a_1,\dots ,a_n)\in H^n,\exists \sigma \in S_n:x\in \prod _{i=1}^n{a}_i,y\in \prod _{i=1}^n{a}_{\sigma \left(i\right)}$$

Take a polygonal SBG of $G=〈H,E〉$ as $(E_1,E_2,\dots ,E_n),$ so that $E_i\cap E_{i+1}\ne \varnothing$ (i.e., $(x,x^{\prime })\in E_i,(x^{\prime },x^{″})\in E_{i+1}$) for $1\le i\le n-1.$ By applying the polygonal concept of SBG, the relation ≈ is defined as follows:

$$x\approx y⟺\exists E_i,1\le i\le n;(x,z)\in E_1,(z,y)\in E_n$$

The relation ≈ is an equivalence relation. The SBG of G is connected and the equivalence class $\left[x\right]=\{y\mid x{\gamma }^{*}y\}=\mid {\gamma }^{*}\left(x\right)\mid ,$ where $\left[x\right]$ is a connected component by Theorem 4. Indeed, the connected components SBG of $G=〈H,E〉$ are equivalence classes modulo ${\gamma }^{*}.$ The geometric space $G=〈H,E〉$ is connected if it includes only one connected component, i.e., $H=\left[x\right],$ for $x\in H.$ Clearly, the relation ≈ is the transitive closure of the relation $\gamma =\bigcup _{n\in N}{\gamma }_n.$ The blocks of the geometric space SBG of $G=〈H,E〉$ using relation ${\gamma }_n$ are the constructed sets with permuting finite hyperproducts of distinct finite points (vertices).

4. SBG for Modeling the Spread Trend of COVID-$\mathit{n}$

SBG can be utilized to model the spread trend of COVID-n by travelers in different countries and on a large scale, involved countries. In this pattern, the vertices represent individuals/countries and edges appoint the relationship among individuals/countries which are based on a fundamental relation.

4.1. Application 1

Let H be the number of individuals. Consider $H=\{\mathrm{Michael},\mathrm{Robert},\mathrm{Emma},\mathrm{Olivia}\}.$ Then, the SBG of $G=〈H,E〉$ is determined in the following way:

• Each vertex addresses an individual
• An edge addresses the relationship between two vertices

Define a binary relation “∘” on H as follows:

$$a\circ b=\{x\mid x\mathrm{get}\mathrm{infected}\mathrm{to}\mathrm{COVID}-\mathit{n}\mathrm{by}\mathrm{person}\mathit{a}\mathrm{or}\mathrm{person}\mathit{b}\}$$

In

Table 2. Hypergroup $(\mathit{H},\circ )$.

∘	Michael = 1	Robert = 2	Emma = 3	Olivia = 4
Michael = 1	1	2	3	4
Robert = 2	2	{1,2}	{3,4}	3
Emma = 3	3	{3,4}	H	{2,3}
Olivia = 4	4	3	{2,3}	{1,4}

, the pair $(H,\circ )$ is a hypergroup.

The following statements are attained from Table 2:

• Either Robert, Michael, or Emma infected Olivia with COVID.
• Emma is the most infectious the person for the transmission of the coronavirus disease and all members get infected by Emma ($3\circ 3=H$).

Consider the relation ${\gamma }_n$ as edges for two arbitrary vertices x and y as:

$$x{\gamma }_{n}y⟺\exists (a_1,\dots ,a_n)\in H^n,\exists \sigma \in S_n:x\in \prod _{i=1}^n{a}_i,y\in \prod _{i=1}^n{a}_{\sigma \left(i\right)}$$

Note that ${\prod }_{i=1}^n{a}_i$ is regarded as a hyperproduct of distinct elements $a_i$ for $i\in \{1,2,\dots ,n\},$ that is $a_1\circ a_2\circ \dots a_n.$ We follow the procedure for all components, i.e.,

$$\begin{array}{cc}\hfill & 1{\gamma }_{2}2⟺1\in 2\circ 2,2\in 2\circ 2\hfill \\ \hfill & 3{\gamma }_{2}4⟺3\in 2\circ 3,4\in 3\circ 2\hfill \\ \hfill & 2{\gamma }_{2}3⟺2\in 3\circ 4,3\in 4\circ 3\hfill \\ \hfill & 1{\gamma }_{2}4⟺1\in 4\circ 4,4\in 4\circ 4\hfill \\ \hfill & 2{\gamma }_{2}4⟺2\in 3\circ 3,4\in 3\circ 3\hfill \\ \hfill & 1{\gamma }_{2}3⟺1\in 3\circ 3,3\in 3\circ 3\hfill \end{array}$$

This means that $(1,2)\in e_1,(3,4)\in e_2,(2,3)\in e_3,(1,4)\in e_4,(2,4)\in e_5,(1,3)\in e_6$ where, $E=\{e_1,e_2,e_3,e_4,e_5,e_6\}$ are the edges of $SBG$. The corresponding SBG of G is depicted in Figure 6a and

Table 3. SBGs of G.

	Michael	Robert	Emma	Olivia
$e_1$	1	1	0	0
$e_2$	0	0	1	1
$e_3$	0	1	1	0
$e_4$	1	0	0	1
$e_5$	0	1	0	1
$e_6$	1	0	1	0

.

Furthermore, the equivalence class of $\left[x\right]$ is considered as the individuals who transmit viral disease COVID to specific person $x,$ that is $\left[x\right]=\{y\mid x{\gamma }^{*}y\},$ where ${\gamma }^{*}$ is the transitive closure of $\gamma$ and $\gamma ={\displaystyle \bigcup _{n\ge 1}}{\gamma }_n.$ Therefore, the class $\left[\mathrm{Michael}\right]=\{\mathrm{Robert},\mathrm{Emma},\mathrm{Olivia}\}$, and so on. By applying Proposition 4, the degree of Michael is $\mid {\gamma }^{*}\left(\mathrm{Michael}\right)\mid =3$ and by Corollary 2, the SBG is 3-regular.

4.2. Application 2

Let H be a set of countries with the most reported cases and death in the world. Consider $H=\left\{\mathrm{USA},\mathrm{Brazil},\mathrm{India},\mathrm{Russia},\mathrm{Mexico},\mathrm{UK},\mathrm{Italy}\right\}.$ Thus, the SBG of $G=〈H,E〉$ is defined as follows

• Every vertex is appointed to a country.
• An edge is appointed to the relationship between two vertices.

Introduce the hyperoperation “⊕” for all $x,y\in H,$ as follows:

$x\oplus y=\mathrm{The}\mathrm{country}\mathrm{or}\mathrm{set}\mathrm{of}\mathrm{countries}\mathrm{that}\mathrm{causes}\mathrm{disease}\mathrm{outbreak}\mathrm{from}\mathrm{country}\mathit{x}\mathrm{to}$$\mathrm{country}\mathit{y}$

The couple $(H,\oplus )$ is a hypergroupoid, as given in

Table 4. Hypergroupoid $(\mathit{H},\oplus )$.

⊕	USA = 1	Brazil = 2	India = 3	Russia = 4	Mexico = 5	UK = 6	Italy = 7
USA = 1	{1,2}	2	{1,2,3}	4	{1,2,5}	{1,6,2}	{1,7,2}
Brazil = 2	2	2	2	{2,4}	2	{2,6}	{1,2}
India = 3	{1,2}	{2,3}	3	{2,3,4}	{1,2,3,5}	{1,2,3,6}	{1,2,3,7}
Russia = 4	{1,4}	2	{3,4}	4	{2,4,5}	{2,4,6}	{1,2,4,7}
Mexico = 5	{1,2,5}	2	{2,3,5}	{1,2,4,5}	5	{1,2,5,6}	H
UK = 6	{1,6}	2	{2,3}	{2,4}	{1,2,5,6}	6	{1,2,4,6,7}
Italy = 7	{1,7}	H	{2,3}	{2,4}	{1,2,5,7}	{2,6,7}	7

.

Consider the relation $\gamma$ given below:

$$x{\gamma }_{n}y⟺\exists (a_1,\dots ,a_n)\in H^n,\exists \sigma \in S_n:x\in \prod _{i=1}^n{a}_i,y\in \prod _{i=1}^n{a}_{\sigma \left(i\right)}$$

we continue the procedure for all elements of $H,$ according to Table 4, that is

$$\begin{array}{c}\hfill 1{\gamma }_{2}2⟺1\in 3\oplus 1,2\in 1\oplus 3\\ \hfill 1{\gamma }_{2}3⟺1\in 3\oplus 5,3\in 5\oplus 3\\ \hfill 1{\gamma }_{2}4⟺1\in 4\oplus 1,4\in 1\oplus 4\\ \hfill 1{\gamma }_{2}5⟺1\in 3\oplus 5,5\in 5\oplus 3\\ \hfill 1{\gamma }_{2}6⟺1\in 1\oplus 6,6\in 6\oplus 1\\ \hfill 1{\gamma }_{2}7⟺1\in 1\oplus 7,7\in 7\oplus 1\\ \hfill 2{\gamma }_{2}3⟺2\in 3\oplus 4,3\in 4\oplus 3\\ \hfill 2{\gamma }_{2}4⟺2\in 3\oplus 4,4\in 4\oplus 3\\ \hfill 2{\gamma }_{2}5⟺2\in 4\oplus 5,5\in 5\oplus 4\\ \hfill 2{\gamma }_{2}6⟺2\in 6\oplus 2,6\in 2\oplus 6\\ \hfill 2{\gamma }_{2}7⟺2\in 1\oplus 7,7\in 7\oplus 1\\ \hfill 3{\gamma }_{2}4⟺3\in 3\oplus 4,4\in 4\oplus 3\\ \hfill 3{\gamma }_{2}5⟺3\in 3\oplus 5,5\in 5\oplus 3\\ \hfill 3{\gamma }_{2}6⟺3\in 6\oplus 3,6\in 3\oplus 6\\ \hfill 3{\gamma }_{2}7⟺3\in 7\oplus 3,7\in 3\oplus 7\\ \hfill 4{\gamma }_{2}5⟺4\in 4\oplus 5,5\in 5\oplus 4\\ \hfill 4{\gamma }_{2}6⟺4\in 6\oplus 7,6\in 7\oplus 6\\ \hfill 4{\gamma }_{2}7⟺4\in 6\oplus 7,7\in 7\oplus 6\\ \hfill 5{\gamma }_{2}6⟺5\in 5\oplus 6,6\in 6\oplus 5\\ \hfill 5{\gamma }_{2}7⟺5\in 5\oplus 7,7\in 7\oplus 5\\ \hfill 6{\gamma }_{2}7⟺6\in 6\oplus 7,7\in 7\oplus 6\end{array}$$

Therefore, $E=\{e_1,\dots ,e_{21}\}$ and the corresponding SBG of G is demonstrated in Figure 6b. By applying Proposition 4, the degree of each vertex is $\mid {\gamma }^{*}\left(z\right)\mid =6,$ and G is complete, and 6-regular. It also has an Eulerian circuit because of connectivity and has an even degree of each vertex; therefore, graph G is Eulerian. The SBG of G is connected and Hamiltonian and the relation $\gamma$ is transitive.

5. Conclusions

The neoteric structure of a semihypergroup-based graph (SBG) is established using a fundamental relation to advance the mathematical concept of an algebraic hypercompositional structure, namely the hypergroup, in the form of graph theory. Additionally, to model and analyze the links in social systems, the developed SBG approach is recommended to intuitively simplify the complicated procedure. Some significant characteristics of SBG are proposed, including connected, complete, regular, Eulerian, isomorphism, and Cartesian products along with illustrative examples and graphical attitude. As per the engagement of all nations and individuals after the global COVID-n pandemic, the resulting SBG is applied to address the trend of transmission of the coronavirus disease in social systems, particularly countries and individuals. The next phase can be the development of fuzzy SBG and intuitionistic fuzzy SBG with further applicable platforms.