Abstract
E. Yi recently introduced the fractional edge dimension of graphs. It has many applications in different areas of computer science such as in sensor networking, intelligent systems, optimization, and robot navigation. In this paper, the fractional edge dimension of vertex and edge transitive graphs is calculated. The class of hypercube graph Q(n) with an odd number of vertices n is discussed. We propose the combinatorial criterion for the calculation of the fractional edge dimension of a graph, and hence applied it to calculate the fractional edge dimension of the friendship graph F-k and the class of circulant graph C-n(1,2).