Hop excellence of paths

Abstract

Excellent graphs introduced by[4] Dr.N. Sridharan and M.Yamuna, had been the motivation for many researchers and so many papers have been written as a result of deep and vast study of excellent graphs. [3] deals with a new type of excellence, namely hop excellence, based on hop domination closely related with distance-2 domination. A graph G is said to be hop excellent if every vertex uϵV belongs to a minimal hop domination set (γh – set) of G. This paper aims to study hop excellence of paths.