Characterizations of $J$-Total Dominating Sets in Some Special Graphs and Graphs under Some Operations

Authors

  • Javier Hassan
  • Jahiri Manditong MSU-Tawi-Tawi College of Technology and Oceanography
  • Alcyn Bakkang
  • Sisteta U. Kamdon
  • Jeffrey Imer Salim

DOI:

https://doi.org/10.29020/nybg.ejpam.v16i4.4912

Keywords:

J-open set, J-total dominating set, J-total domination number

Abstract

Let G be a graph with no isolated vertex. A subset M ⊆ V (G) is called a J-open set if NG(a)\NG(b) ̸= ∅ and NG(b)\NG(a) ̸= ∅ ∀ a, b ∈ M, where a ̸= b. If in addition, M is a total dominating in G, then we call M a J-total dominating set in G. The maximum cardinality among
all J-total dominating set in G, denoted by γJt(G), is called the J-total domination number of G. In this paper, we characterize J-total dominating sets in some special graphs and join of two graphs, and we use these results to obtain formulas for the parameters of these graphs. Moreover, we determine its relationships with other known parameters in graph theory. Finally, we derive the lower bound of the parameter for the corona of two graphs.

Downloads

Published

2023-10-30

Issue

Vol. 16 No. 4: (October 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 journal, the author(s) accept(s) the transfer of copyright of the article to European Journal of Pure and Applied Mathematics.

European Journal of Pure and Applied Mathematics will be Copyright Holder.

How to Cite

Characterizations of $J$-Total Dominating Sets in Some Special Graphs and Graphs under Some Operations. (2023). European Journal of Pure and Applied Mathematics, 16(4), 2106-2117. https://doi.org/10.29020/nybg.ejpam.v16i4.4912