A new entropy for hypergraphs
From MaRDI portal
Recommendations
Cites work
- A history of graph entropy measures
- A Mathematical Theory of Communication
- Depth-based hypergraph complexity traces from directed line graphs
- Dynamical zeta functions
- Graph characteristics from the heat kernel trace
- GRAPH ZETA FUNCTION AND DIMENSION OF COMPLEX NETWORK
- scientific article; zbMATH DE number 426390 (Why is no real title available?)
- scientific article; zbMATH DE number 43754 (Why is no real title available?)
- scientific article; zbMATH DE number 107482 (Why is no real title available?)
- scientific article; zbMATH DE number 3796014 (Why is no real title available?)
- scientific article; zbMATH DE number 3245394 (Why is no real title available?)
- Hypergraph theory. An introduction
- On the von Neumann entropy of a graph
- Robust similarity between hypergraphs based on valuations and mathematical morphology operators
- The Laplacian of a graph as a density matrix: a basic combinatorial approach to separability of mixed states
Cited in
(4)- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- On the Shannon entropy of the number of vertices with zero in-degree in randomly oriented hypergraphs
- Functional analysis on hypergraphs: density and zeta functions -- applications to molecular graphs and image analysis
- Applications of the Lambert-Tsallis W_q function in graph theory and quantum networks
This page was built for publication: A new entropy for hypergraphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5237052)