Graphs that Split Entropies

DOI10.1137/0401008MaRDI QIDQ3033797zbMATHOpenAlexFDO

Authors

Publication date 1988

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/0401008

zbMATH Keywords

network flowsgraph coveringgraph entropyperfect graphs

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Information theory (general) (94A15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Recommendations

• Entropy splitting hypergraphs
• scientific article; zbMATH DE number 167195
• Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing
• scientific article; zbMATH DE number 7410277
• Szeged-like entropies of graphs
• The entropy of a thermodynamic graph
• Entropy and the complexity of graphs revisited
• Entropy versus heterogeneity for graphs
• scientific article; zbMATH DE number 780788
• On the von Neumann entropy of graphs

Cited in

(15)

• Disproving the normal graph conjecture
• Poset entropy versus number of linear extensions: the width-2 case.
• Perfect graphs and graph entropy: An updated survey
• Graph pairs and their entropies: Modularity problems
• Some bounds of weighted entropies with augmented Zagreb index edge weights
• On equistable, split, CIS, and related classes of graphs
• Perfect couples of graphs
• Entropy of symmetric graphs
• Constructions for normal graphs and some consequences
• On the capacity of Boolean graph formulæ
• Generalizing Körner's graph entropy to graphons
• Symmetric graphs with respect to graph entropy
• Partitioning multi-dimensional sets in a small number of ``uniform parts
• Extremality of graph entropy based on degrees of uniform hypergraphs with few edges
• The normal graph conjecture for two classes of sparse graphs

This page was built for publication: Graphs that Split Entropies

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3033797)