Hop Excellence of Paths: Advanced Study

  • P. Getchial Pon Packiavathi Department of Mathematics, V.V.Vanniaperumal College for Women, Virudhunagar, India.
  • S. Balamurugan Department of Mathematics, Government Arts College, Melur, India.
  • R. B. Gnana Jothi Department of Mathematics, V.V.Vanniaperumal College for Women, Virudhunagar, India.
Keywords: Dominating set, excellent graphs and hop dominating set

Abstract

Excellent graphs introduced by [1] 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. [2] 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 Screenshot_129.png belongs to a minimal hop domination set Screenshot_236.png of G. This paper aims to study hop excellence of paths.

Published
2020-07-09
How to Cite
Packiavathi, P. G. P., Balamurugan, S., & Jothi, R. B. G. (2020). Hop Excellence of Paths: Advanced Study. Emerging Trends in Engineering Research and Technology Vol. 6, 1-10. Retrieved from https://stm1.bookpi.org/index.php/etert-v6/article/view/1673
Issue
Emerging Trends in Engineering Research and Technology Vol. 6
Section
Chapters