We prove an upper bound on the Shannon capacity of a graph via a linear programming variation. We also show that our bound can be better than Lovász theta number and Haemers minimum rank bound.

This letter formulates sufficient conditions for observability of a class of linear time invariant systems with a norm output. The observability of these systems depends on the input and will be ...