Information processing in complex networks: Graph entropy and information functionals
From MaRDI portal
Publication:945216
DOI10.1016/j.amc.2007.12.010zbMath1152.05361OpenAlexW2054439077MaRDI QIDQ945216
Publication date: 12 September 2008
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2007.12.010
Related Items (54)
Sharp lower bounds on the Narumi-Katayama index of graph operations ⋮ Entropy bounds for dendrimers ⋮ Complexity of subdivision-vertex and subdivision-edge join graphs ⋮ Entropy of weighted graphs with Randić weights ⋮ Resolution of Yan's Conjecture on Entropy of Graphs ⋮ Graph Operations Decreasing Values of Degree-Based Graph Entropies ⋮ 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 ⋮ Degree-based entropies of networks revisited ⋮ Szeged-like entropies of graphs ⋮ Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions ⋮ Bounds for degree-based network entropies ⋮ Symmetric Laplacians, quantum density matrices and their von-Neumann entropy ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ On the zeros of the partial Hosoya polynomial of graphs ⋮ On topological properties of degree-based entropy of hex-derived network of type 3 ⋮ Depth-based hypergraph complexity traces from directed line graphs ⋮ Subgraph centrality and walk-regularity ⋮ Network entropy and systemic risk in dynamic banking systems ⋮ On measuring the complexity of networks: Kolmogorov complexity versus entropy ⋮ 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 ⋮ Depth-based complexity traces of graphs ⋮ Topological indices and graph entropies for carbon nanotube Y-junctions ⋮ The domination numbers of cylindrical grid graphs ⋮ Amoeba Techniques for Shape and Texture Analysis ⋮ Graph measures with high discrimination power revisited: a random polynomial approach ⋮ THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS ⋮ Walk entropies in graphs ⋮ New inequalities between information measures of network information content ⋮ Large-scale analysis of structural branching measures ⋮ On the degeneracy of the Randić entropy and related graph measures ⋮ Network entropies based on independent sets and matchings ⋮ Walk entropy and walk-regularity ⋮ Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection ⋮ Extremality of degree-based graph entropies ⋮ Probabilistic inequalities for evaluating structural network measures ⋮ Maximum values of degree-based entropies of bipartite graphs ⋮ Fifty years of graph matching, network alignment and network comparison ⋮ Inequalities for entropy-based measures of network information content ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Some new bounds of weighted graph entropies with GA and Gaurava indices edge weights ⋮ Graph entropy based on the number of spanning forests of \(c\)-cyclic graphs ⋮ A survey on the mathematical foundations of axiomatic entropy: representability and orderings ⋮ 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 ⋮ Computing the numbers of independent sets and matchings of all sizes for graphs with bounded treewidth ⋮ Generalized degree-based graph entropies ⋮ VISCOELASTIC PROPERTIES OF NETWORKS ⋮ A hybrid binomial inverse hypergeometric probability distribution: theory and applications ⋮ The effect of graph operations on the degree-based entropy
Cites Work
- A note on two problems in connexion with graphs
- Cybernetical physics. From control of chaos to quantum control.
- Structural information content of networks: graph entropy based on local vertex functionals
- Parallel concepts in graph theory
- Information theoretic measures of UHG graphs with low computational complexity
- A faster algorithm for betweenness centrality*
- A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
- Entropy and the complexity of graphs: III. Graphs with prescribed information content
- Entropy and the complexity of graphs: IV. Entropy measures and graphical structure
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Information processing in complex networks: Graph entropy and information functionals
