• THE UPPER CONNECTED EDGE DETOUR NUMBER OF AN EDGE DETOUR GRAPH

Abstract

For any two vertices  and  in a connected graph , the detour distance  is the length of a longest   path in . A  path of length   is called a detour. A set  is called an edge detour set of if every edge in  lies on a detour joining a pair of vertices of . A connected edge detour set of a graph  is a edge detour set such that the sub graph  induced by  is connected. The minimum cardinality of a connected edge.....