The \rho -Capacity of a Graph

DOI10.1109/TIT.2017.2669196MaRDI QIDQ5280894zbMATH OpenFDO

Authors Sihuang Hu, Ofer Shayevitz

Publication date 27 July 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.07263

Mathematics Subject Classification ID

Measures of information, entropy (94A17)

Abstract: Motivated by the problem of zero-error broadcasting, we introduce a new notion of graph capacity, termed $ho$-capacity, that generalizes the Shannon capacity of a graph. We derive upper and lower bounds on the $ho$-capacity of arbitrary graphs, and provide a Lov'asz-type upper bound for regular graphs. We study the behavior of the $ho$-capacity under two graph operations: the strong product and the disjoint union. Finally, we investigate the connection between the structure of a graph and its $ho$-capacity.

Cited in

(2)

• Hofer-Zehnder capacity and Bruhat graph
• Capacities of graphs and \(2\)-matchings

This page was built for publication: The $\rho $ -Capacity of a Graph

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