Graphs that Split Entropies

DOI10.1137/0401008zbMath0692.05054OpenAlexW2074450708MaRDI QIDQ3033797

No author found.

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 flowsperfect graphsgraph entropygraph covering

Mathematics Subject Classification ID

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

Related Items (12)

On equistable, split, CIS, and related classes of graphs ⋮ Entropy of symmetric graphs ⋮ The normal graph conjecture for two classes of sparse graphs ⋮ Sorting under partial information (without the ellipsoid algorithm). ⋮ Disproving the normal graph conjecture ⋮ Symmetric graphs with respect to graph entropy ⋮ Perfect couples of graphs ⋮ Some bounds of weighted entropies with augmented Zagreb index edge weights ⋮ Poset entropy versus number of linear extensions: the width-2 case. ⋮ Constructions for normal graphs and some consequences ⋮ On the capacity of Boolean graph formulæ ⋮ Extremality of graph entropy based on degrees of uniform hypergraphs with few edges

This page was built for publication: Graphs that Split Entropies