Symmetric Shannon capacity is the independence number minus 1
Tam\'as Terpai

TL;DR
This paper introduces and calculates a symmetric version of Shannon capacity, providing insights into graph theory and information theory by exploring a new capacity measure.
Contribution
It defines and computes a symmetric Shannon capacity, a novel variant that extends traditional capacity concepts in graph theory.
Findings
Defined a symmetric Shannon capacity
Computed the capacity for specific graphs
Extended understanding of graph capacities
Abstract
A symmetric variant of Shannon capacity is defined and computed.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
