On graph entropy measures based on the number of independent sets and matchings
From MaRDI portal
Publication:2660906
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph theory (including graph drawing) in computer science (68R10) Measures of information, entropy (94A17)
Recommendations
Cites work
- A history of graph entropy measures
- A note on distance-based graph entropies
- Advances in network complexity
- An introduction to Kolmogorov complexity and its applications
- Bounds for degree-based network entropies
- Complexity in chemistry, biology and ecology.
- Complexity in chemistry. Introduction and fundamentals.
- Degree-based entropies of networks revisited
- Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
- Entropy of weighted graphs with Randić weights
- Extremality of degree-based graph entropies
- Generalized degree-based graph entropies
- scientific article; zbMATH DE number 3745213 (Why is no real title available?)
- scientific article; zbMATH DE number 1232919 (Why is no real title available?)
- scientific article; zbMATH DE number 7410277 (Why is no real title available?)
- scientific article; zbMATH DE number 7410337 (Why is no real title available?)
- scientific article; zbMATH DE number 3062467 (Why is no real title available?)
- Inequalities for entropy-based measures of network information content
- Inequalities: theory of majorization and its applications
- Information processing in complex networks: Graph entropy and information functionals
- Information, randomness and incompleteness. Papers on algorithmic information theory
- Maxima and minima of the Hosoya index and the Merrifield-Simmons index
- Network entropies based on independent sets and matchings
- Novel inequalities for generalized graph entropies -- graph energies and topological indices
- On extremal properties of graph entropies
- On measuring the complexity of networks: Kolmogorov complexity versus entropy
- On structure-sensitivity of degree-based topological indices
- On the distance based graph entropies
- On the extremal values of general degree-based graph entropies
- On the Length of Programs for Computing Finite Binary Sequences
- Probabilistic inequalities for evaluating structural network measures
- Randić index and information
- Sequential codes, lossless compression of individual sequences, and Kolmogorov complexity
- Three approaches to the quantitative definition of information*
- Two problems on independent sets in graphs
- Walk entropies in graphs
Cited in
(10)- Network entropies based on independent sets and matchings
- New network entropy : The domination entropy of graphs
- Graph entropies, enumeration of circuits, walks and topological properties of three classes of isoreticular metal organic frameworks
- Maximum values of degree-based entropies of bipartite graphs
- Recovering Set Systems and Graph Entropy
- Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
- On extremal cacti with respect to the first degree-based entropy
- On neighborhood inverse sum indeg index of molecular graphs with chemical significance
- Graphs with minimum degree-entropy
- On graph entropy measures based on the number of dominating and power dominating sets
This page was built for publication: On graph entropy measures based on the number of independent sets and matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2660906)
