Information processing in complex networks: Graph entropy and information functionals
From MaRDI portal
Recommendations
- Structural information content of networks: graph entropy based on local vertex functionals
- A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
- Entropy and the complexity of graphs revisited
- Network entropy using edge-based information functionals
- scientific article; zbMATH DE number 780788
Cites work
- A faster algorithm for betweenness centrality*
- A note on two problems in connexion with graphs
- A NOVEL METHOD FOR MEASURING THE STRUCTURAL INFORMATION CONTENT OF NETWORKS
- Cybernetical physics. From control of chaos to quantum control.
- 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
- scientific article; zbMATH DE number 1600999 (Why is no real title available?)
- scientific article; zbMATH DE number 5542185 (Why is no real title available?)
- scientific article; zbMATH DE number 4074878 (Why is no real title available?)
- scientific article; zbMATH DE number 4089609 (Why is no real title available?)
- scientific article; zbMATH DE number 176034 (Why is no real title available?)
- scientific article; zbMATH DE number 3468645 (Why is no real title available?)
- scientific article; zbMATH DE number 194437 (Why is no real title available?)
- scientific article; zbMATH DE number 3226832 (Why is no real title available?)
- Information theoretic measures of UHG graphs with low computational complexity
- Parallel concepts in graph theory
- Structural information content of networks: graph entropy based on local vertex functionals
Cited in
(70)- The \(H_0\) function, a new index for detecting structural/topological complexity information in undirected graphs
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- Degree-based entropies of networks revisited
- Bounds for degree-based network entropies
- Network entropy and systemic risk in dynamic banking systems
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- Network entropies based on independent sets and matchings
- Walk entropy and walk-regularity
- On congruity of nodes and assortative information content in complex networks
- Fifty years of graph matching, network alignment and network comparison
- 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
- New network entropy : The domination entropy of graphs
- Characterising heavy-tailed networks using q-generalised entropy and q-adjacency kernels
- The effect of graph operations on the degree-based entropy
- Graph entropies, enumeration of circuits, walks and topological properties of three classes of isoreticular metal organic frameworks
- Szeged-like entropies of graphs
- Computational analysis of topological index-based entropies of carbon nanotube \(Y\)-junctions
- Graph measures with high discrimination power revisited: a random polynomial approach
- On the degeneracy of the Randić entropy and related graph measures
- Maximum values of degree-based entropies of bipartite graphs
- 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
- Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
- 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
- A hybrid binomial inverse hypergeometric probability distribution: theory and applications
- Symmetric Laplacians, quantum density matrices and their von-Neumann entropy
- Maximal entropy coverings and the information dimension of a complex network
- Depth-based hypergraph complexity traces from directed line graphs
- Subgraph centrality and walk-regularity
- A calculus for measuring the elegance of abstract graphs
- Walk entropies in graphs
- 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
- Sharp lower bounds on the Narumi-Katayama index of graph operations
- Entropy bounds for dendrimers
- Entropy of weighted graphs with Randić weights
- Information theory of complex networks: on evolution and architectural constraints
- Entropy and the complexity of graphs revisited
- New inequalities between information measures of network information content
- Amoeba techniques for shape and texture analysis
- Large-scale analysis of structural branching measures
- Network entropy using edge-based information functionals
- Upper and lower bounds for the \(q\)-entropy of network models with application to network model selection
- Complexity of subdivision-vertex and subdivision-edge join graphs
- Resolution of Yan's conjecture on entropy of graphs
- Graph Operations Decreasing Values of Degree-Based Graph Entropies
- Extremality of degree-based graph entropies
- Probabilistic inequalities for evaluating structural network measures
- Quantifying networks complexity from information geometry viewpoint
- Information properties of co-processing model on communication networks
- Viscoelastic properties of networks
- On extremal cacti with respect to the first degree-based entropy
- Topological indices and graph entropies for carbon nanotube Y-junctions
- THE NUMBER OF CC-DOMINATING SETS OF SOME GRAPHS
- The domination numbers of cylindrical grid graphs
- On entropy measures of some titania and carbon nanotubes
- The structure entropy of social networks
- On the minimality of degree-based graph entropy for connected graphs
- On the main distance-based entropies: the eccentricity- and Wiener-entropy
- Minimal degree-based graph entropy for dense graphs
- Degree-based and neighborhood degree sum-based entropy measures of Molnupiravir
- Generalized entropies of subdivision-corona networks
- On graph entropy measures based on the number of dominating and power dominating sets
- Depth-based complexity traces of graphs
- Structural information content of networks: graph entropy based on local vertex functionals
- Inequalities for entropy-based measures of network information content
This page was built for publication: Information processing in complex networks: Graph entropy and information functionals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q945216)
