Is the lean graph of an RDF graph unique?

Is the lean graph of an RDF graph unique?

If RDF graphs G1 and G2 are two leanified versions of RDF graph G, then G1 and G2 are equivalent, in the sense of RDF graph equivalence.

G1 and G2 may have different blank node labels, if you use a graph representation that keeps track of blank node labels, but graphs that differ just in blank node labels are equivalent.