Results 251 to 260 of about 942,096 (280)
Some of the next articles are maybe not open access.
New network entropy: The domination entropy of graphs
Information Processing Letters, 2022zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
On Complementary Graph Entropy
IEEE Transactions on Information Theory, 2009It has been recently discovered that complementary graph entropy characterizes (and offers new insights into) the minimum asymptotic rate for zero-error source coding with decoder side information. This paper presents new results that build on and complement this discovery.
Ertem Tuncel +3 more
openaire +1 more source
Graph-Theoretic Properties of Sub-Graph Entropy
IEEE Signal Processing Letters, 2021Sub-graph entropy has recently been applied to functional brain network analysis for identifying important brain regions associated with different brain states and for discriminating brain networks of subjects with psychiatric disorders from healthy controls. This letter describes two pertinent properties of sub-graph entropy.
Bhaskar Sen, Keshab K. Parhi
openaire +2 more sources
Source Coding and Graph Entropies
IEEE Transactions on Information Theory, 1996zbMATH Open Web Interface contents unavailable due to conflicting licenses.
A Orlitsky, N Alon
exaly +3 more sources
Entropy versus Heterogeneity for Graphs
2011In this paper we explore and compare two contrasting graph characterizations. The first of these is Estrada's heterogeneity index, which measures the heterogeneity of the node degree across a graph. Our second measure is the the von Neumann entropy associated with the Laplacian eigenspectrum of graphs.
Lin Han +2 more
openaire +2 more sources
On the von Neumann entropy of a graph
Discrete Applied Mathematics, 2018zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hongying Lin, Bo Zhou 0007
openaire +2 more sources
Hosoya entropy of fullerene graphs
Applied Mathematics and Computation, 2019zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Modjtaba Ghorbani +4 more
openaire +3 more sources
On the distance based graph entropies
Applied Mathematics and Computation, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Aleksandar Ilic, Matthias Dehmer
openaire +3 more sources
Graph Pairs and their Entropies: Modularity Problems
Combinatorica, 2000If the union of graphs \(F\), \(G\) on the same vertex set is the complete graph then for every probability distribution \(P\), the inequality \(H(F\cup G,P)+H(F\cap G,P)\leq H(F,P)+H(G,P)\) holds if and only if there is no 3-vertex set containing one edge of each of \(F-G\), \(G-F\), and \(F\cap G\), where \(H(G,P)\) is the graph entropy.
KORNER, JANOS, SIMONYI G.
openaire +2 more sources
Recovering Set Systems and Graph Entropy
Combinatorics, Probability and Computing, 1997Let \(\mathcal A\) and \(\mathcal B\) be two families of subsets of an \(n\)-set, such that for all \(A,A'\in {\mathcal A}\) and \(B,B'\in {\mathcal B}\) the following two conditions hold: (i) If \(A\setminus B = A'\setminus B'\) then \(A=A'\). (ii) If \(B\setminus A = B'\setminus A'\) then \(B=B'\). A pair of such set systems \(({\mathcal A},{\mathcal
Attila Sali, Gábor Simonyi
openaire +2 more sources