IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/2517415.html
   My bibliography  Save this article

A Mathematical Approach on Representation of Competitions: Competition Cluster Hypergraphs

Author

Listed:
  • Sovan Samanta
  • G. Muhiuddin
  • Abdulaziz M. Alanazi
  • Kousik Das

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.

Suggested Citation

  • Sovan Samanta & G. Muhiuddin & Abdulaziz M. Alanazi & Kousik Das, 2020. "A Mathematical Approach on Representation of Competitions: Competition Cluster Hypergraphs," Mathematical Problems in Engineering, Hindawi, vol. 2020, pages 1-10, June.
    • Handle: RePEc:hin:jnlmpe:2517415
    DOI: 10.1155/2020/2517415
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2020/2517415.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2020/2517415.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2020/2517415?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Ghulam Muhiuddin & Sovan Samanta & Abdulrahman F. Aljohani & Abeer M. Alkhaibari, 2023. "A Study on Graph Centrality Measures of Different Diseases Due to DNA Sequencing," Mathematics, MDPI, vol. 11(14), pages 1-18, July.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:2517415. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.