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 u
V
belongs
to a minimal hop domination set h set of G. This
paper aims to study hop excellence of paths.
Author(s) Details
Mrs. P. Getchial Pon Packiavathi
Department of Mathematics, V.V.Vanniaperumal College for Women, Virudhunagar, India.
Dr. S. Balamurugan
Department of Mathematics, Government Arts College, Melur, India.
Dr. R. B. Gnana Jothi
Department of Mathematics, V.V.Vanniaperumal College for Women, Virudhunagar, India.
View Book :- http://bp.bookpi.org/index.php/bpi/catalog/book/200
Author(s) Details
Mrs. P. Getchial Pon Packiavathi
Department of Mathematics, V.V.Vanniaperumal College for Women, Virudhunagar, India.
Dr. S. Balamurugan
Department of Mathematics, Government Arts College, Melur, India.
Dr. R. B. Gnana Jothi
Department of Mathematics, V.V.Vanniaperumal College for Women, Virudhunagar, India.
View Book :- http://bp.bookpi.org/index.php/bpi/catalog/book/200
No comments:
Post a Comment