Identifying codes in vertex-transitive graphs and strongly regular graphs

We consider the problem of computing identifying codes of graphs and its frac-tional relaxation. The ratio between the size of optimal integer and fractional so-lutions is between 1 and 2 ln(|V |) + 1 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 |α with α ∈ {14, 13, 25}. These families are generalized quadrangles (strongly regular graphs based on finite geometries). They also provide examples for metric dimension of graphs