Total Perfect Hop Domination in Graphs Under Some Binary Operations

Authors

DOI:

https://doi.org/10.29020/nybg.ejpam.v14i3.3975

Abstract

Let G = (V (G), E(G)) be a simple graph. A set S ⊆ V (G) is a perfect hop dominating set of G if for every v ∈ V (G) \ S, there is exactly one vertex u ∈ S such that dG(u, v) = 2. The smallest cardinality of a perfect hop dominating set of G is called the perfect hop domination number of G, denoted by γph(G). A perfect hop dominating set S ⊆ V (G) is called a total perfect hop dominating set of G if for every v ∈ V (G), there is exactly one vertex u ∈ S such that dG(u, v) = 2. The total perfect hop domination number of G, denoted by γtph(G), is the smallest cardinality of a total perfect hop dominating set of G. Any total perfect hop dominating set of G of cardinality γtph(G) is referred to as a γtph-set of G. In this paper, we characterize the total perfect hop dominating sets in the join, corona and lexicographic product of graphs and determine their corresponding total perfect hop domination number.

Author Biographies

  • Raicah Cayongcat Rakim, Mindanao State University
    Associate Professor, Math Department, CNSM, MSU-Main Campus, Marawi City
  • Helen M Rara, Mindanao State University, Iligan institute of Technology
    Professor, Department of Mathematics and Statistic, Clollege of Science and Mathematics, MSU-Iligan Institute of Technology, Iligan City

Downloads

Published

2021-08-05

Issue

Vol. 14 No. 3: (July 2021)

Section

Nonlinear Analysis

License

Upon acceptance of an article by the European Journal of Pure and Applied Mathematics, the author(s) retain the copyright to the article. However, by submitting your work, you agree that the article will be published under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0). This license allows others to copy, distribute, and adapt your work, provided proper attribution is given to the original author(s) and source. However, the work cannot be used for commercial purposes.

By agreeing to this statement, you acknowledge that:

  • You retain full copyright over your work.
  • The European Journal of Pure and Applied Mathematics will publish your work under the Creative Commons Attribution-NonCommercial 4.0 International License (CC BY-NC 4.0).
  • This license allows others to use and share your work for non-commercial purposes, provided they give appropriate credit to the original author(s) and source.

How to Cite

Total Perfect Hop Domination in Graphs Under Some Binary Operations. (2021). European Journal of Pure and Applied Mathematics, 14(3), 803-815. https://doi.org/10.29020/nybg.ejpam.v14i3.3975