A simple generalization of the Luenberger method for pole assignment is introduced which allows one to obtain a greater number of feedback laws giving both the desired poles to the system and the ...

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.