Weakly Connected Hop Domination in Graphs Resulting from Some Binary Operations

Authors

  • Jamil Hamja MSU-TCTO
  • Imelda S. Aniversario
  • Catherina I. Merca

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i1.4587

Keywords:

Weakly Connected Set, Hop Dominating Set

Abstract

Let G = (V(G),E(G)) be a simple connected graph. A set S ⊆ V(G) is a weakly connected hop dominating set of G if for every q ∈ V \ S, there exists r ∈ S such that dG(q,r) = 2, the subgraph weakly induced by S, denoted by ⟨S⟩w = ⟨NG[S],Ew⟩ where Ew = {qr ∈ E(G) : q ∈ S or r∈S } is connected and S is a dominating set of G. The minimum cardinality of a weakly connected hop dominating set of G is called weakly connected hop domination number and is denoted by γwh(G). In this paper, the authors show and explore the concept of weakly connected hop dominating set. The weakly connected hop dominating set of some special graphs, shadow of graphs, join, corona and Lexicographic product of two graphs are characterized. Also, the weakly connected domination number of the aforementioned graphs are determined.

Keywords: weakly connected set, hop dominating set, hop domination number, weakly connected hop dominating set, and weakly connected hop domination number

 

Downloads

Published

2023-01-29

Issue

Vol. 16 No. 1: (January 2023)

Section

Nonlinear Analysis

License

Copyright (c) 2023 European Journal of Pure and Applied Mathematics

Creative Commons License

This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International 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

Weakly Connected Hop Domination in Graphs Resulting from Some Binary Operations. (2023). European Journal of Pure and Applied Mathematics, 16(1), 454-464. https://doi.org/10.29020/nybg.ejpam.v16i1.4587