Please use this identifier to cite or link to this item:
http://111.93.204.14:8080/xmlui/handle/123456789/1153
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Maity, Ananta | - |
dc.contributor.author | Das, Kousik | - |
dc.contributor.author | Samanta, Sovan | - |
dc.contributor.author | Mondal, Sukumar | - |
dc.contributor.author | Dubey, Vivek | - |
dc.date.accessioned | 2022-12-15T08:07:39Z | - |
dc.date.available | 2022-12-15T08:07:39Z | - |
dc.date.issued | 2021-02 | - |
dc.identifier.uri | http://111.93.204.14:8080/xmlui/handle/123456789/1153 | - |
dc.description.abstract | In this study, cluster hypergraphs are introduced to generalize the concept of hypergraphs, where cluster nodes are allowed. Few related terms and properties on cluster hypergraphs are discussed. Some operations, including the Cartesian product, union, intersection, etc., are studied. Diferent types of matrix representations and isomorphism are also proposed on cluster hypergraphs. The notion of an efective degree for nodes is introduced to capture the group/ cluster efects. At last, the area of applications and future directions with conclusions is deployed. | en_US |
dc.language.iso | en | en_US |
dc.publisher | Social Network Analysis and Mining | en_US |
dc.subject | Hypergraphs | en_US |
dc.subject | Cluster hypergraphs | en_US |
dc.subject | Degree and efective degree | en_US |
dc.subject | Basic operations | en_US |
dc.subject | Matrix representation | en_US |
dc.title | A study of cluster hypergraphs and its properties | en_US |
dc.type | Article | en_US |
Appears in Collections: | Articles |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Maity2021_Article_AStudyOfClusterHypergraphsAndI.pdf | 724.21 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.