where \(r(D)\)  denotes the rank of the divisor \(D\)  of the graph \(G\) , in the sense of Baker and Norine [1]} (see Section ). Classically, for curves, we have \(H_f(P) = H_r(P) = H(P)\) . However this is not the case for graphs, for instance the cardinality of the set difference \(H_f(P) \setminus H_r(P)\)  can be arbitrarily large [2]}.
