Clique based centrality measure in hypergraphs

DOI10.21638/11701/SPBU31.2024.03MaRDI QIDQ6892436zbMATH OpenFDO

Authors Ruolin Huang, Anna Tur

Publication date 28 November 2025

Full work available at URL https://doi.org/10.21638/11701/SPBU31.2024.03

zbMATH Keywords

centrality measurecliquecooperative gamehypergraphShapley valuesocio-philosophical analysis

Mathematics Subject Classification ID

Hypergraphs (05C65) Cooperative games (91A12)

Cites work

• A modified Myerson value for determining the centrality of graph vertices
• Game-theoretic centrality measures for weighted graphs
• scientific article; zbMATH DE number 3078997 (Why is no real title available?)
• Hypergraph theory. An introduction
• Importance of Agents in Networks: Clique Based Game-Theoretic Approach
• The clique minimal separator decomposition of a hypergraph
• Three hypergraph eigenvector centralities

This page was built for publication: Clique based centrality measure in hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6892436)