An Analogue of the Shannon Capacity of a Graph

DOI10.1137/0607008zbMath0717.05070OpenAlexW2100329573MaRDI QIDQ3204507

Martin Farber

Publication date: 1986

Published in: SIAM Journal on Algebraic Discrete Methods (Search for Journal in Brave)

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

zbMATH Keywords

independent domination numberShannon capacity

Mathematics Subject Classification ID

Graph theory (05C99)

Related Items (2)

Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ Asymptotic values of the Hall-ratio for graph powers

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Independent domination in chordal graphs
• Analogues of the Shannon Capacity of a Graph
• On the Shannon capacity of a graph
• On a Problem of C. E. Shannon in Graph Theory
• Hide and Seek, Data Storage, and Entropy

This page was built for publication: An Analogue of the Shannon Capacity of a Graph