A Mathematical Approach on Representation of Competitions: Competition Cluster Hypergraphs

Abstract

Social networks are represented using graph theory. In this case, individuals in a social network are assumed as nodes. Sometimes institutions or groups are also assumed as nodes. Institutions and such groups are assumed as cluster nodes that contain individuals or simple nodes. Hypergraphs have hyperedges that include more than one node. In this study, cluster hypergraphs are introduced to generalize the concept of hypergraphs, where cluster nodes are allowed. Sometimes competitions in the real world are done as groups. Cluster hypergraphs are used to represent such kinds of competitions. Competition cluster hypergraphs of semidirected graphs (a special type of mixed graphs called semidirected graphs, where the directed and undirected edges both are allowed) are introduced, and related properties are discussed. To define competition cluster hypergraphs, a few properties of semidirected graphs are established. Some associated terms on semidirected graphs are studied. At last, a numerical application is illustrated.