Hop Excellence of Paths
P. Getchial Pon Packiavathi1, Balamurugan2, R.B. Gnana Jothi3
1P. Getchial Pon Packiavathi, Assistant Professor, Departmante of Mathematics, V. V. Vanniaperumal College for Women, Virudhunagar.
2S. Balamurugan, Assistant Professor, Department of Mathematics, Department Government Arts College, Melur, India.
3R. B. Gnana Jothi, M.Phil Co-ordinator of Mathematics, Depatment of V. V. Vanniaperumal College for Women, Virudhunagar, India.
Manuscript received on 05 September 2019 | Revised Manuscript received on 29 September 2019 | Manuscript Published on 29 June 2020 | PP: 382-384 | Volume-8 Issue-10S2 August 2019 | Retrieval Number: J106808810S19/2019©BEIESP | DOI: 10.35940/ijitee.J1068.08810S19
Open Access | Editorial and Publishing Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open-access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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 (γn-set) of G. This paper aims to study hop excellence of paths.
Keywords: Dominating Set, Excellent Graphs and Hop Dominating Set.
Scope of the Article: Cryptography and Applied Mathematics