How can bintprog can be used to find minimum nodes in a network through which whole network becomes visible?

How can bintprog can be used to find minimum nodes in a network through which whole network becomes visible?

EX. Say we have network with 7 nodes with connectivity as shown in the below adjacency matrix. And using the below adjacency matrix, am supposed to select minimum number of nodes from which all the other nodes and hence the network becomes visible.

so if bintprog is used in optimization tool is it ok to specify the constraint as f=[-1;-1;-1;-1;-1;-1;-1;];

and the inequality vector as b=[1;1;1;1;1;1;1;];

A[7][7]=[ 1 1 0 0 0 0 0 ; 1 1 1 0 0 1 1 ; 0 1 1 1 0 1 0 ; 0 0 1 1 1 0 1 ; 0 0 0 1 1 0 0 ; 0 1 1 0 0 1 0 ; 0 1 0 1 0 0 1;];

Not able to get through how to formulate this using bintprog. Manually its clearly visible that selecting node 2 and 4 makes the whole network visible. so can you please help in solving the same.

Thanks&Regards Anitha