A history of graph entropy measures

DOI10.1016/j.ins.2010.08.041zbMath1204.94050OpenAlexW2091613287WikidataQ105583639 ScholiaQ105583639MaRDI QIDQ621629

Publication date: 28 January 2011

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2010.08.041

zbMATH Keywords

entropy graphs information theory graph entropy information measures information inequalities structural complexity graph complexity

Mathematics Subject Classification ID

Applications of graph theory (05C90) Measures of information, entropy (94A17) History of information and communication theory (94-03)

Related Items (79)

On computation of degree-based entropy of planar octahedron networks ⋮ Sharp lower bounds on the Narumi-Katayama index of graph operations ⋮ On the likelihood of forests ⋮ Entropy bounds for dendrimers ⋮ A network-based feature selection approach to identify metabolic signatures in disease ⋮ Entropy of weighted graphs with Randić weights ⋮ The Hosoya entropy of a graph ⋮ Graph Operations Decreasing Values of Degree-Based Graph Entropies ⋮ Entropy Measures of Distance Matrix ⋮ Novel inequalities for generalized graph entropies -- graph energies and topological indices ⋮ Graph entropies, enumeration of circuits, walks and topological properties of three classes of isoreticular metal organic frameworks ⋮ Allometric scaling of von Neumann entropy in animal connectomes and its evolutionary aspect ⋮ Degree-based entropies of networks revisited ⋮ Szeged-like entropies of graphs ⋮ Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions ⋮ Quasi-Laplacian centrality: a new vertex centrality measurement based on quasi-Laplacian energy of networks ⋮ An efficient heuristic approach to detecting graph isomorphism based on combinations of highly discriminating invariants ⋮ Bounds for degree-based network entropies ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Fast algorithms for indices of nested split graphs approximating real complex networks ⋮ On topological properties of degree-based entropy of hex-derived network of type 3 ⋮ Depth-based hypergraph complexity traces from directed line graphs ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ Demand-aware network designs of bounded degree ⋮ Entropy and the complexity of graphs revisited ⋮ On extremal cacti with respect to the first degree-based entropy ⋮ A calculus for measuring the elegance of abstract graphs ⋮ Polyhedral graphs via their automorphism groups ⋮ Hess' law requires modified mathematical rules for information entropy of interdependent chemical reactions ⋮ Spectral complexity of directed graphs and application to structural decomposition ⋮ Depth-based complexity traces of graphs ⋮ Quasi-Laplacian energy of composite graphs ⋮ Relationships between symmetry-based graph measures ⋮ A computational approach to construct a multivariate complete graph invariant ⋮ On the relationship between PageRank and automorphisms of a graph ⋮ The connection between process complexity of event sequences and models discovered by process mining ⋮ Graph measures with high discrimination power revisited: a random polynomial approach ⋮ Towards detecting structural branching and cyclicity in graphs: a polynomial-based approach ⋮ Walk entropies in graphs ⋮ Szeged and Mostar root-indices of graphs ⋮ Characterization and comparison of large directed networks through the spectra of the magnetic Laplacian ⋮ On structural properties of trees with minimal atom-bond connectivity index ⋮ The entropy of weighted graphs with atomic bond connectivity edge weights ⋮ Digraphs with large maximum Wiener index ⋮ A novel method for analyzing inverse problem of topological indices of graphs using competitive agglomeration ⋮ Counterexamples to conjectures on graph distance measures based on topological indexes ⋮ Network entropies based on independent sets and matchings ⋮ Quantifying information loss on chaotic attractors through recurrence networks ⋮ On the distance based graph entropies ⋮ Extremality of degree-based graph entropies ⋮ Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography ⋮ New property of a generalized Hölder's inequality and its applications ⋮ Probabilistic inequalities for evaluating structural network measures ⋮ Maximum values of degree-based entropies of bipartite graphs ⋮ Unnamed Item ⋮ ENTROPY OF SOME MODELS OF SPARSE RANDOM GRAPHS WITH VERTEX-NAMES ⋮ Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights ⋮ Hosoya entropy of fullerene graphs ⋮ Laplacian centrality: A new centrality measure for weighted networks ⋮ Reversed version of a generalized sharp Hölder's inequality and its applications ⋮ Correlation of automorphism group size and topological properties with program-size complexity evaluations of graphs and complex networks ⋮ On the extremal values of general degree-based graph entropies ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs ⋮ A comparative analysis of new graph distance measures and graph edit distance ⋮ Network Distances for Weighted Digraphs ⋮ A note on distance-based entropy of dendrimers ⋮ New network entropy : The domination entropy of graphs ⋮ Extremality of graph entropy based on degrees of uniform hypergraphs with few edges ⋮ Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels ⋮ First degree-based entropy of graphs ⋮ A New Entropy for Hypergraphs ⋮ Stitch fix for mapper and topological gains ⋮ Quantitative graph theory: a new branch of graph theory and network science ⋮ Entropy of tournament digraphs ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth ⋮ Generalized degree-based graph entropies ⋮ A hybrid binomial inverse hypergeometric probability distribution: theory and applications ⋮ The effect of graph operations on the degree-based entropy ⋮ On Network Similarities and Their Applications

Cites Work

This page was built for publication: A history of graph entropy measures