# Concepts on Coloring of Cluster Hypergraphs with Application

Authors: Sovan Samanta; Jeong Gon Lee; Usman Naseem; Shah Khalid Khan; Kousik Das
Journal: Mathematical Problems in Engineering
 (2020)

---

## Abstract

Coloring of graph theory is widely used in different fields like the map coloring, traffic light problems, etc. Hypergraphs are an extension of graph theory where edges contain single or multiple vertices. This study analyzes cluster hypergraphs where cluster vertices too contain simple vertices. Coloring of cluster networks where composite/cluster vertices exist is done using the concept of coloring of cluster hypergraphs. Proper coloring and strong coloring of cluster hypergraphs have been defined. Along with these, local coloring in cluster hypergraphs is also provided. Such a cluster network, COVID19 affected network, is assumed and colored to visualize the affected regions properly.


---

## Body

## 1. Introduction

A hypergraph is a generalization of a graph in which any subset of a vertex set is an edge rather than two vertex sets. Specially, Berge [1–3] introduced hypergraphs as generalization of graph theory. Burosch and Cecherini [4] characterized cube-hypergraphs, where each hyperedge contains three vertices. Sonntag and Teichert [5, 6] defined hypertrees, and they extended the notion to competition hypergraphs in another paper in 2004. To capture the notion of a cluster node, cluster hypergraphs have been introduced by Samanta et al. [7]. Uniformity and completeness properties of cluster hypergraphs have been developed here.There are two common ways of defining colorings of hypergraphs. The first was introduced by Erdős and Hajnal [8, 9] and involves that no edge is monochromatic. Such a coloring is sometimes referred to as weak coloring. In the other case, strong coloring/rainbow coloring is done, in such a way that no two vertices belonging to a single edge share the same color [10]. Alon and Bregman [11] introduced 2 coloring in regular and uniform hypergraphs. This work has been extended by Vishwanathan [12]. Frieze and Mubayi [13] introduced the coloring in simple hypergraphs. Chang and Lawler [14] discussed edge coloring of hypergraphs. They also solved the conjecture of Erdos, Faber, and Lovász. Furmanczyk and Obszarski [15] extended the coloring concepts to the equitable coloring of a hypergraph. Beck [16] discussed some properties on 3-chromatic hypergraphs. Obszarski and Jastrzębski [17] added more results on edge coloring of 3-uniform hypergraphs to their earlier studies [15]. Nešetřil et al. [18] defined achromatic number of simple hypergraphs. In hypergraphs, a polychromatic coloring [19] is a coloring of its vertices such that every hyperedge comprises at least one vertex of each color. A polychromatic m-coloring of a hypergraph resembles a cover m-decomposition of its dual hypergraph. Král’a et al. [20] proved that feasible sets of mixed hypertrees are gap-free. Equitable colorings of a uniform hypergraph [21] deal with an extremal problem.Dvořák and Postle [22] presented the idea of so-called DP-coloring, thereby extending the concept of list-coloring. DP-coloring was analyzed in detail by Bernshteyn, Kostochka, and Pron for graphs and multigraphs. DP-degree [23] for hypergraphs has been extended, with reminiscence that “a vertex coloring of a hypergraph is called proper if there are no monochromatic edges under this coloring. A hypergraph is said to be equitably r-colorable if there is a proper coloring with r colors such that the sizes of any two color classes differ by at most one.”The chronological literature review is shown in Table1 and Figure 1. All the mentioned studies focused on the vertex and edge coloring of hypergraphs. Here, the cluster node concepts have been considered for coloring of nodes. The existing coloring concepts are not adequate to this newly defined cluster hypergraph. This study implements the two ways of coloring, proper and strong coloring in cluster hypergraphs. Additionally, the coloring technique of nodes inside the cluster has been depicted. This type of coloring is termed local coloring.Table 1
Chronological contributions of the authors towards coloring of cluster hypergraphs.
YearAuthorsContributions1961Berge [1–3]Introduction of hypergraphs1973Erdos and Lovász [9]On 3-chromatic hypergraphs1974Toft [24]Coloring of hypergraphs1988Chang and Lawler [14]Edge coloring of hypergraphs1996Chen and Frieze [25]Coloring of bipartite hypergraphs2005Agnarsson and Halldorsson [10]Strong coloring of hypergraphs2013Frieze and Mubayi [13]Coloring of simple hypergraphs2019Furmanczyk, Obszarski [15]Equitable coloring of hypergraphs2020Edwards and Rzążewski [26]Complete coloring of hypergraphs2020Samanta et al. [7]Introduction of cluster hypergraphs2020Samanta et al. [This paper]Coloring of cluster hypergraphsFigure 1
Pictorial representation of the literature of hypergraph colorings.Until now, hypergraphs contain only simple nodes. This representation has problems while representing cluster/group nodes. The concept of clustering can be found as follows. Clustering algorithms [27–30] are advanced as a powerful tool to examine the massive amount of data. The focal goal of these algorithms is to categorize the data in clusters of objects, so that data in each cluster are similar based on precise criteria and data from two dissimilar clusters be different as much as possible. This study initiated the concept of cluster hypergraphs [7] with several properties. Coloring on hypergraphs is an old phenomenon. As this study presents about coloring of cluster nodes, simple nodes inside the cluster nodes get the same color. This issue has been rectified using fuzzy color. Thus, this paper introduces an entirely new idea on coloring, i.e., fuzzy coloring on crisp cluster hypergraphs. At present, representation of COVID19 affected regions is focused by researchers. This coloring technique has been implemented to such cases using coloring of cluster hypergraphs.


## 2. Hypergraphs

Definition 1.
LetU=u1,u2,…,un be a finite set and let E=e1,e2,…,em be a family of subsets of U such that(1)ei≠ϕi=1,2,…,m,∪i=1mei=U.
The pairU,E is called a hypergraph with vertex set U and hyperedge set E. The elements u1,u2,…,un of U are vertices of a hypergraph H, and the sets e1,e2,…,em are hyperedges of a hypergraph H.
The length of a cycle is the number of edges in it. The girth of a hypergraph is the length of the shortest cycle it contains.
A vertex coloring of a hypergraphH is called proper coloring, if any hyperedge of size greater than or equal to two contains at least two vertices of different colors.
A hypergraphH=V,E consists of a finite set V=VH of vertices and a collection E=EH⊆PV of subsets of V. A strong coloring of H is a map Ψ:VH⟶N such that whenever u,v∈e for some e∈EH, Ψu≠Ψv. The corresponding strong chromatic number χsH is the least number of colors for which G has a strong coloring.
By the degree of a vertexv, denoted by degv, we mean the number of edges containing v.
ByΔH, we denote the maximum vertex degree in the hypergraph H.


## 3. Cluster Hypergraphs

Definition 2.
(see [7]): Let X be a nonempty set and VX be a subset of PX such that ϕ∉VX and X⊂VX. Now, E be a multiset whose elements belong to PPX such that(i)
ϕ∉E.(ii)
For each elemente∈E, there exists at least one element v∈VX such that v∈e.
Then,G=VX,E is said to be cluster hypergraph where VX is said to be vertex set and E is said to be multi-hyperedge set. Throughout this paper, hyperedges are termed edges. An example of cluster hypergraph is shown in Figure 2, and its corresponding virtual representation is shown in Figure 3.Definition 3.
LetX be a nonempty set and VX be a subset of PkX, k=1,2,3…, such that ϕ∉VX and X⊂VX. Now, E be a multiset whose elements belong to PVX such that(i)
ϕ∉E.(ii)
For each elemente∈E, there exists at least one element v∈VX such that v∈e.
Then,G=VX,E is said to be k-cluster hypergraph where VX is said to be vertex set and E is said to be multi-hyperedge set. Generally, for k=1, 1−cluster hypergraphs are assumed as cluster hypergraphs.Definition 4.
The nodes which are not contained in any other cluster nodes are called maximal nodes. A simple node may be termed a maximal node if it does not belong to any other nodes. For example, in Figure4(a), the node g is a simple as well as a maximal node, and the node a,b is a maximal but nonsimple node.Figure 2
Cluster hypergraphs.Figure 3
Virtual representation of Figure2.Figure 4
Proper and strong coloring of CCCH: (a) a cluster hypergraph; (b) proper coloring of cluster hypergraphs; (c) strong coloring of cluster hypergraphs.
(a)(b)(c)Definition 5.
A cluster hypergraph is called am,n−uniform cluster hypergraph if each edge of the hypergraph contains exactly m nodes, and each maximal node contains n simple nodes. In Figure 5, a 2,3−uniform cluster hypergraph is shown.Figure 5
A (2, 3)-uniform cluster hypergraph.Definition 6.
A cluster hypergraph is called a cluster connected cluster hypergraph (CCCH) if there are edges which connect only maximal cluster nodes. In Figure6, a CCCH has been drawn.Figure 6
Visual representations of a CCCH.Definition 7.
A CCCH is called a complete cluster hypergraph if there exists an edge between any two maximal nodes. An example of a complete CCCH is shown in Figure7.Figure 7
A complete CCCH.Definition 8.
A uniform cluster hypergraph is called a completem,n−uniform cluster hypergraph if there exist an edge between any two maximal nodes and an edge between any two simple nodes within cluster nodes. An example of a complete (2, 3)-uniform cluster hypergraph is shown in Figure 8.Figure 8
A complete uniform CCCH.


## 4. Cluster Hypergraph Coloring

A vertex coloring of a cluster hypergraphH is called proper coloring, if any edge connecting at least two maximal nodes contains at least two such maximal nodes of different colors. All the nonmaximal nodes are given the same color as the corresponding maximal nodes.A cluster hypergraphH=V,E consists of a finite set V=VH of vertices and a collection E=EH⊆PV of subsets of V. A strong coloring of G is a map Ψ:VH⟶N such that whenever u,v are maximal nodes and u,v∈e for some e∈EG, Ψu≠Ψv.Example 1.
In Figure4(a), a cluster hypergraph H=VX,E is drawn where X=a,b,d,e,g, VX=a,b,d,e,g,c=a,b,f=d,e, and E=a,b,d,e,g,a,b,d,e,d,e,e,g. In Figure 4(b), a proper coloring is shown. The graph has three maximal nodes c=a,b,f=d,e,g. Now the edge a,b,d,e,g connects all the three maximal nodes. As per the proper coloring method, two maximal nodes are to be given a different color. The nonmaximal nodes will get the same color as of its maximal nodes and similarly for others. In Figure 4(c), strong coloring has been shown. The graph has three maximal nodes c=a,b,f=d,e,g. Now the edge a,b,d,e,g connects all the three maximal nodes. Hence, as per the strong coloring method, the nodes in an edge will get separate colors. The nonmaximal nodes will get equal color as of its maximal nodes and similarly for others.


### 4.1. Chromatic Number

The minimum number of color to use the proper coloring (or strong coloring) method for coloring cluster hypergraphs is termed chromatic number based on proper coloring (or strong coloring). The corresponding proper chromatic numberχH is the least number of colors for which H has a proper coloring. The corresponding strong chromatic number χsH is the least number of colors for which H has a strong coloring.Theorem 1.
The chromatic number based on strong coloring (or proper coloring) of a path in a cluster hypergraph is size of an edge containing the maximum number of maximal nodes (or two).Proof.
Let us consider a pathv1,e1,v2,e2,…,vm in a cluster hypergraph H=VX,E, where vi,i=1,2,…m, are maximal nodes (see Figure 9).Figure 9
Coloring of paths in cluster hypergraphs: (a) coloring of a path based on proper coloring; (b) coloring of a path based on strong coloring.
(a)(b)Case 1.
(strong coloring): As per definition of strong coloring, each node of an edge gets separate color. Thus, size of an edge containing the maximum number of maximal nodes gets maximum color. Hence, the chromatic numberχH based on strong coloring of a path in cluster hypergraphs is the size of an edge containing a maximum number of maximal nodes.Case 2 (proper coloring):.
As per the definition of proper coloring, two nodes of an edge get separate color. Thus, in a path, maximal nodes get alternating color. The chromatic number based on proper coloring of a path in a cluster hypergraph is two.Theorem 2.
The chromatic numberχsH based on strong coloring of a cycle in cluster hypergraphs is the size of an edge containing the maximum number of maximal nodes provided a number of such maximal nodes is greater than or equal to three; otherwise, the chromatic number is two or three.Proof.
Let us consider a cyclev1,e1,v2,e2,…,vm,em,v1 in a cluster hypergraph H=VX,E, where vi,i=1,2,…m, are maximal nodes (see Figure 10). Also, let the maximum size of an edge in the graph be k.Figure 10
Coloring of cycles in cluster hypergraphs: (a) coloring of a cycle based on proper coloring; (b) coloring of a cycle based on proper coloring; (c) coloring of a cycle based on strong coloring.
(a)(b)(c)Case 1.
(k≥3): As per the definition of strong coloring, each node of an edge gets separate color. Thus, the size of an edge containing the maximum number of maximal nodes gets maximum color. Hence, the chromatic number based on strong coloring of a cycle in a cluster hypergraph is size of an edge containing the maximum number of maximal nodes.Case 2.
(k = 2): As the cluster hypergraph contains edges of size two, for odd length cycles, the chromatic number is three, and for even length cycles, the chromatic number is two.Corollary 1.
The chromatic number based on proper coloring of a cycle in cluster hypergraphs is two provided the maximum size of an edge is greater than or equal to three. If the maximum size of an edge is equal to two, even length cycles have chromatic number two and three for odd length cycles.Theorem 3.
Chromatic number of a CCCH is at least two and at most equal to the number of maximal nodes of the graph.Proof.
Let us consider a CCCH. Now the edges may contain two maximal nodes at least. In that case, the chromatic number is the number of maximal nodes in the graph. If the edges contain more than two vertices, then the chromatic number may reduce to two, if all nodes are included in a single edge.


### 4.2. Bipartite or 2-Colorable Cluster Hypergraphs

A cluster hypergraphH is bipartite if its maximal node set can be partitioned into two independent sets (nonadjacent node set) such that every edge connects both partite sets of maximal nodes or connects intercluster nodes. Equivalently, H is a bipartite if it is 2-colorable by proper coloring.


### 4.3.n-Partite Cluster Hypergraphs

Let us define an-partite cluster hypergraph as a n-uniform cluster hypergraph whose maximal nodes can be partitioned into n independent sets (nonadjacent node sets) and each edge is incident to exactly one maximal node from each partition or is incident to intramaximal cluster nodes only. It is to be mentioned that if there is an edge in a maximal cluster, the edge may contain any number of nodes, not necessarily n nodes.Example 2.
In Figure11, a 3,3−uniform cluster hypergraph has been shown. It can be noted that edges connect three maximal nodes of three independent sets. Also, edges may connect intercluster nodes. Naturally, the chromatic number is 2 for this case. In Figure 12, another 3,3−uniform cluster hypergraph is colored by strong coloring technique. The chromatic number χsH is 3.
Note 1: LetH be a cluster hypergraph of maximal vertex degree Δ of maximal nodes, such that its each edge contains at least δ maximal nodes. Let k=2Δ/δ. Then, the following holds.(1)
The chromatic number ofH is k+1 by proper vertex coloring.(2)
The chromatic number ofH is k by proper vertex coloring if δ≥3 and k≥3.
Note 2: Every minimally nonbipartite cluster hypergraph has at least as many edges as vertices.Figure 11
Proper coloring of 3-partite cluster hypergraphs.Figure 12
Strong coloring of 3-partite cluster hypergraphs.Theorem 4.
For anyn-uniform cluster hypergraph H, the two inequalities hold: ΔH≤χH≤nΔH−n+1.Proof.
The first inequality is true by observation. The second inequality can be acceptable in the following way. Each edge in anyn-uniform cluster hypergraph has at most nΔH−n neighbors of maximal nodes. Hence, for a certain edge e even if all the adjacent edges have various colors, the algorithm has always generalized to chromatic number χH of H which is less than or equal to the number of neighbors + 1. Thus, ΔH≤χH≤nΔH−n+1.


### 4.4. Local Coloring on Nonmaximal Nodes

In proper coloring or strong coloring, maximal nodes are given colors. But simple or cluster nodes inside maximal nodes are given the same color as of their corresponding maximal nodes. To differ the color of nonmaximal nodes, local degree is assumed. Local degree of a nonmaximal node is the number of intramaximal node edges incident to the node.The local degree of a vertexf in Figure 13 is 4. The local degree of nonmaximal nodes in Figure 13 is given in Table 2.Figure 13
Local cluster representation of a 2-cluster hypergraph: (a) cluster hypergraph; (b) virtual representation of intramaximal nodes of (a).
(a)(b)Table 2
Local degrees of nonmaximal nodes of Figure13.
VerticesLocal degreeNormalized valuea10.25b30.75c20.50d20.50e20.50f41.00Based on the normalized value of local degree, fuzzy colors are given to the nonmaximal nodes. If a maximal node gets a color say “BLUE”, then the nodes within the maximal node with normalized valuew get mixed of the color BLUE 100w% and white (100−100w)%. As per Table 2, f gets the basic color BLUE, and b gets a mixture of 75% BLUE and 25% of white color. c, d, and e get a mixture of 50% BLUE and 50% white and so on (see Figure 14).Figure 14
Coloring of nonmaximal nodes.


## 4.1. Chromatic Number

The minimum number of color to use the proper coloring (or strong coloring) method for coloring cluster hypergraphs is termed chromatic number based on proper coloring (or strong coloring). The corresponding proper chromatic numberχH is the least number of colors for which H has a proper coloring. The corresponding strong chromatic number χsH is the least number of colors for which H has a strong coloring.Theorem 1.
The chromatic number based on strong coloring (or proper coloring) of a path in a cluster hypergraph is size of an edge containing the maximum number of maximal nodes (or two).Proof.
Let us consider a pathv1,e1,v2,e2,…,vm in a cluster hypergraph H=VX,E, where vi,i=1,2,…m, are maximal nodes (see Figure 9).Figure 9
Coloring of paths in cluster hypergraphs: (a) coloring of a path based on proper coloring; (b) coloring of a path based on strong coloring.
(a)(b)Case 1.
(strong coloring): As per definition of strong coloring, each node of an edge gets separate color. Thus, size of an edge containing the maximum number of maximal nodes gets maximum color. Hence, the chromatic numberχH based on strong coloring of a path in cluster hypergraphs is the size of an edge containing a maximum number of maximal nodes.Case 2 (proper coloring):.
As per the definition of proper coloring, two nodes of an edge get separate color. Thus, in a path, maximal nodes get alternating color. The chromatic number based on proper coloring of a path in a cluster hypergraph is two.Theorem 2.
The chromatic numberχsH based on strong coloring of a cycle in cluster hypergraphs is the size of an edge containing the maximum number of maximal nodes provided a number of such maximal nodes is greater than or equal to three; otherwise, the chromatic number is two or three.Proof.
Let us consider a cyclev1,e1,v2,e2,…,vm,em,v1 in a cluster hypergraph H=VX,E, where vi,i=1,2,…m, are maximal nodes (see Figure 10). Also, let the maximum size of an edge in the graph be k.Figure 10
Coloring of cycles in cluster hypergraphs: (a) coloring of a cycle based on proper coloring; (b) coloring of a cycle based on proper coloring; (c) coloring of a cycle based on strong coloring.
(a)(b)(c)Case 1.
(k≥3): As per the definition of strong coloring, each node of an edge gets separate color. Thus, the size of an edge containing the maximum number of maximal nodes gets maximum color. Hence, the chromatic number based on strong coloring of a cycle in a cluster hypergraph is size of an edge containing the maximum number of maximal nodes.Case 2.
(k = 2): As the cluster hypergraph contains edges of size two, for odd length cycles, the chromatic number is three, and for even length cycles, the chromatic number is two.Corollary 1.
The chromatic number based on proper coloring of a cycle in cluster hypergraphs is two provided the maximum size of an edge is greater than or equal to three. If the maximum size of an edge is equal to two, even length cycles have chromatic number two and three for odd length cycles.Theorem 3.
Chromatic number of a CCCH is at least two and at most equal to the number of maximal nodes of the graph.Proof.
Let us consider a CCCH. Now the edges may contain two maximal nodes at least. In that case, the chromatic number is the number of maximal nodes in the graph. If the edges contain more than two vertices, then the chromatic number may reduce to two, if all nodes are included in a single edge.


## 4.2. Bipartite or 2-Colorable Cluster Hypergraphs

A cluster hypergraphH is bipartite if its maximal node set can be partitioned into two independent sets (nonadjacent node set) such that every edge connects both partite sets of maximal nodes or connects intercluster nodes. Equivalently, H is a bipartite if it is 2-colorable by proper coloring.


## 4.3.n-Partite Cluster Hypergraphs

Let us define an-partite cluster hypergraph as a n-uniform cluster hypergraph whose maximal nodes can be partitioned into n independent sets (nonadjacent node sets) and each edge is incident to exactly one maximal node from each partition or is incident to intramaximal cluster nodes only. It is to be mentioned that if there is an edge in a maximal cluster, the edge may contain any number of nodes, not necessarily n nodes.Example 2.
In Figure11, a 3,3−uniform cluster hypergraph has been shown. It can be noted that edges connect three maximal nodes of three independent sets. Also, edges may connect intercluster nodes. Naturally, the chromatic number is 2 for this case. In Figure 12, another 3,3−uniform cluster hypergraph is colored by strong coloring technique. The chromatic number χsH is 3.
Note 1: LetH be a cluster hypergraph of maximal vertex degree Δ of maximal nodes, such that its each edge contains at least δ maximal nodes. Let k=2Δ/δ. Then, the following holds.(1)
The chromatic number ofH is k+1 by proper vertex coloring.(2)
The chromatic number ofH is k by proper vertex coloring if δ≥3 and k≥3.
Note 2: Every minimally nonbipartite cluster hypergraph has at least as many edges as vertices.Figure 11
Proper coloring of 3-partite cluster hypergraphs.Figure 12
Strong coloring of 3-partite cluster hypergraphs.Theorem 4.
For anyn-uniform cluster hypergraph H, the two inequalities hold: ΔH≤χH≤nΔH−n+1.Proof.
The first inequality is true by observation. The second inequality can be acceptable in the following way. Each edge in anyn-uniform cluster hypergraph has at most nΔH−n neighbors of maximal nodes. Hence, for a certain edge e even if all the adjacent edges have various colors, the algorithm has always generalized to chromatic number χH of H which is less than or equal to the number of neighbors + 1. Thus, ΔH≤χH≤nΔH−n+1.


## 4.4. Local Coloring on Nonmaximal Nodes

In proper coloring or strong coloring, maximal nodes are given colors. But simple or cluster nodes inside maximal nodes are given the same color as of their corresponding maximal nodes. To differ the color of nonmaximal nodes, local degree is assumed. Local degree of a nonmaximal node is the number of intramaximal node edges incident to the node.The local degree of a vertexf in Figure 13 is 4. The local degree of nonmaximal nodes in Figure 13 is given in Table 2.Figure 13
Local cluster representation of a 2-cluster hypergraph: (a) cluster hypergraph; (b) virtual representation of intramaximal nodes of (a).
(a)(b)Table 2
Local degrees of nonmaximal nodes of Figure13.
VerticesLocal degreeNormalized valuea10.25b30.75c20.50d20.50e20.50f41.00Based on the normalized value of local degree, fuzzy colors are given to the nonmaximal nodes. If a maximal node gets a color say “BLUE”, then the nodes within the maximal node with normalized valuew get mixed of the color BLUE 100w% and white (100−100w)%. As per Table 2, f gets the basic color BLUE, and b gets a mixture of 75% BLUE and 25% of white color. c, d, and e get a mixture of 50% BLUE and 50% white and so on (see Figure 14).Figure 14
Coloring of nonmaximal nodes.


## 5. Scope of Applications

Cluster hypergraphs are convenient to represent any social networks. The recent literature on social network analysis can be found in [31–36]. This small example illustrates the network spread by COVID19 in worldwide. The taken data are shown in Table 3. It can be noted that nearby countries (based on a certain distance) form a cluster. If one cluster is affected by other clusters, then one edge is used to connect the clusters. The network is shown in Figure 15. The network as a cluster hypergraph is colored by proper coloring (see Figure 16).Table 3
Country-wise COVID19 affected people.
No.CountryCOVID19 affected peopleTotal deaths1USA3,11,6378,4542Spain1,30,75912,4183Italy1,24,63215,3624Germany96,1081,4445France89,9537,5606China81,6693,3297Iran58,2263,6038UK41,9034,3139Turkey23,93450110Switzerland20,51066611Belgium19,6911,44712Netherlands16,6271,65113Canada14,01823314Austria11,85020415Portugal10,52426616Brazil10,36044517S. Korea10,23718318Israel8,0184619Sweden6,44337320Australia5,6873421Norway5,6456222Russia4,7314323Ireland4,60413724Czechia4,4756225Chile4,1612726Denmark4,07716127Romania3,86414828Poland3,8348429Malaysia3,6626130India3,5889931Ecuador3,46517232Philippines3,24615233Japan3,1397734Pakistan2,8804535Luxembourg2,7293136Saudi Arabia2,3702937Indonesia2,27319838Thailand2,1692339Finland1,9272540Mexico1,8907941Panama1,8014642Peru1,7467343Greece1,6736844Serbia1,6244445South Africa1,585946D. Republic1,5787747UAE1,5051048Argentina1,4514349Iceland1,417450Colombia1,4063251Qatar1,325352Algeria1,25113053Ukraine1,2513254Singapore1,189655Croatia1,12612Figure 15
COVID19 affected countries.Figure 16
A proper coloring of the assumed network shown in Figure15.Benefits of the study are as follows:(1)
This study analyzed cluster hypergraphs, a generalized class of hypergraphs.(2)
This study provided several properties of cluster hypergraphs, including a CCCH, a complete CCCH, and a uniform CCCH.(3)
Proper coloring and strong coloring have been defined for cluster hypergraphs. Local coloring for nonmaximal nodes has also been introduced.(4)
Proper coloring of COVID19 affected regions has been shown.


## 6. Conclusions

This study developed basic terminologies of cluster hypergraphs. Coloring of cluster hypergraphs are analyzed by two basic techniques. Proper coloring and strong coloring are two ways of coloring of cluster hypergraphs. Additionally, the coloring of intranodes of a maximal node is depicted. Finally, a small network is considered for the coloring purpose.In future, several complex network problems can be solved by cluster hypergraph coloring/labelling. In particular, every social network is a cluster hypergraph. The centrality of a simple node is no longer important compared to the centrality of a cluster node. This study is a backbone for such applications.



---

*Source: 3705156-2020-08-11.xml*