[en] We consider the problem of computing identifying codes of graphs and its fractional relaxation. The ratio between the optimal integer and fractional solutions is between 1 and 2 log(|V|) where V is the set of vertices of the graph. We focus on vertex-transitive graphs for which we can compute the exact fractional solution. There are known examples of vertex-transitive graphs that reach both bounds. We exhibit infinite families of vertex-transitive graphs with integer and fractional identifying codes of order |V|^a with a in {1/4, 1/3, 2/5}. These families are generalized quadrangles (strongly regular graphs based on finite geometries). They also provide examples for metric dimension of graphs.
