Inequalities on networks have played important roles in the theory of networks. We study the famous Sobolev-Poincare's inequality on infinite net-works in the weighted form. This inequality is closely related to the smallest eigenvalue of a weighted discrete Laplacian. We give a dual characterization for the smallest eigenvalue.