Let G be a graph and denote by Q(G)=D(G)+A(G),L(G)=D(G)-A(G) the sum and the difference between the diagonal matrix of vertex degrees and the adjacency matrix o
In this paper, we investigate the convergence properties of the Fletcher Reeves algorithm. Under conditions weaker than those in a paper of M. A1-Baali,we get t