Ravi Srivastava

On k-Geodetic Edge Traceable Graph

A graph G is k-geodetic edge traceable if every edge of G lies in at least one geodesic of length k. The maximum geodesic edge-covering number $$\textrm{gec}_{\max }(G)$$ is the minimum number of largest fixed-length geodesics that cover all edges of G. We study some properties o...