{"title":"Hub Parameters of Hypergraph","authors":"Nandhini Chandrasekar, K. K. Myithili","doi":"10.22342/jims.30.1.1443.100-109","DOIUrl":null,"url":null,"abstract":"A hypergraph is an extension of a graph in which one edge can connect any number of vertices. In contrary, an edge connects exactly two vertices in a graph.In this paper we introduce hub-hyperpath, hubset and hubnumber of a hypergraph. Also we defined the hubnumber of a different types of hypergraphs and analyze some of its properties. Then the hub number of a hypergraph is compared with its dual hypergraph. Hubset can be useful for various tasks, such as targeted marketing and social networks. Additionally, finding the hub number of a graph is useful in network security, as it helps in identifying nodes that, if compromised, could have a significant impact on the overall network.","PeriodicalId":0,"journal":{"name":"","volume":"36 4","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.22342/jims.30.1.1443.100-109","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
A hypergraph is an extension of a graph in which one edge can connect any number of vertices. In contrary, an edge connects exactly two vertices in a graph.In this paper we introduce hub-hyperpath, hubset and hubnumber of a hypergraph. Also we defined the hubnumber of a different types of hypergraphs and analyze some of its properties. Then the hub number of a hypergraph is compared with its dual hypergraph. Hubset can be useful for various tasks, such as targeted marketing and social networks. Additionally, finding the hub number of a graph is useful in network security, as it helps in identifying nodes that, if compromised, could have a significant impact on the overall network.
分享
京公网安备 11010802042870号
京ICP备2023020795号-1
求助内容：
应助结果提醒方式：
扫码关注我们
