On the fractional edge dimension of graphs

Let [Formula: see text] be a connected graph. For any vertex [Formula: see text] and edge [Formula: see text], the distance between the vertex [Formula: see text] and the edge [Formula: see text] is defined as [Formula: see text]. A vertex [Formula: see text] is said to resolve two distinct edges [Formula: see text] if [Formula: see text]. Let [Formula: see text] be defined by [Formula: see text]. A real valued function [Formula: see text] is an edge resolving function of [Formula: see text] if [Formula: see text] for any two distinct edges [Formula: see text], where [Formula: see text]. The fractional edge dimension of [Formula: see text] is given by [Formula: see text]: [Formula: see text] is an edge resolving function of [Formula: see text], where [Formula: see text]. In this paper, we study the fractional edge dimension of prism [Formula: see text], antiprism [Formula: see text], the web graph [Formula: see text], and the triangular winged prism graph TWP[Formula: see text].