Open AccessHop Excellence of Paths
Publication year - 2019
Publication title -
international journal of innovative technology and exploring engineering
Language(s) - English
Resource type - Journals
ISSN - 2278-3075
DOI - 10.35940/ijitee.j1068.08810s19
Subject(s) - excellence , hop (telecommunications) , vertex (graph theory) , graph , computer science , mathematics , combinatorics , telecommunications , political science , law
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.