Symmetric Shannon capacity is the independence number minus 1

DOI10.1007/S10998-021-00441-7MaRDI QIDQ2678437zbMATH OpenOpenAlexFDO

Authors Tamás Terpai

Publication date 23 January 2023

Published in Periodica Mathematica Hungarica (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

graph productindependence numberShannon capacity

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Capacity of Two-Way Channels With Symmetry Properties
• scientific article; zbMATH DE number 3494264
• The Shannon capacity of a union
• A combinatorial lemma and Shannon's theorem for binary symmetric channels
• scientific article; zbMATH DE number 3961490
• scientific article; zbMATH DE number 3997696
• $\epsilon$-Capacity of Binary Symmetric Averaged Channels
• On some characterizations of the Shannon entropy using extreme symmetry and block symmetry
• scientific article; zbMATH DE number 1574609
• scientific article; zbMATH DE number 1983989

Cites work

• A limit theorem for the Shannon capacities of odd cycles I
• A limit theorem for the Shannon capacities of odd cycles. II
• On the Shannon capacity of a graph
• The Shannon capacity of a graph and the independence numbers of its powers

Cited in

(1)

• Symmetric Shannon capacity is the independence number minus 1

This page was built for publication: Symmetric Shannon capacity is the independence number minus 1

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