S. Athisayanathan

  • Citations Per Year
Learn More
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour(More)
In this paper, we define the clique-to-vertex C–v monophonic path, the clique-to-vertex monophonic distance dm(C, v), the clique-to-vertex monophonic eccentricity em2(C), the clique-to-vertex monophonic radius Rm2 , and the clique-to-vertex monophonic diameter Dm2 , where C is a clique and v a vertex in a connected graph G. We determine these parameters for(More)
For two vertices u and v in a graph G = (V, E), the detour distance D(u, v) is the length of a longest u–v path in G. A u–v path of length D(u, v) is called a u–v detour. A set S ⊆ V is called an edge detour set if every edge in G lies on a detour joining a pair of vertices of S. The edge detour number dn1(G) of G is the minimum order of its edge detour(More)
For two vertices u and v in a graph G = (V, E), the detour distance D (u, v) is the length of a longest u – v path in G. A u – v path of length D (u, v) is called a u – v detour. For subsets A and B of V, the detour distance D (A, B) is defined as D (A, B) = min {D (x, y) : x ∈ A, y ∈ B}. A u – v path of length D (A, B) is called an A – B detour joining the(More)
  • 1