$J^2$-Hop Domination in Graphs: Properties and Connections with Other Parameters
DOI:
https://doi.org/10.29020/nybg.ejpam.v16i4.4905Keywords:
J^2-sets, J^2-hop dominating sets, J^2-hop domination numberAbstract
A subset $T=\{v_1, v_2, \cdots, v_m\}$ of vertices of an undirected graph $G$ is called a $J^2$-set if$N_G^2[v_i]\setminus N_G^2[v_j]\neq \varnothing$ for every $i\neq j$, where $i,j\in\{1, 2, \ldots, m\}$.
A $J^2$-set is called a $J^2$-hop dominating in $G$ if for every $a\in V(G)\s T$, there exists $b\in T$
such that $d_G(a,b)=2$. The $J^2$-hop domination number of $G$, denoted by $\gamma_{J^2h}(G)$, is the maximum
cardinality among all $J^2$-hop dominating sets in $G$. In this paper, we introduce this new parameter and we
determine its connections with other known parameters in graph theory. We derive its bounds with respect to
the order of a graph and other known parameters on a generalized graph, join and corona of two graphs. Moreover,
we obtain exact values of the parameter for some special graphs and shadow graphs using the characterization
results that are formulated in this study.
Downloads
Published
2023-10-30
License
Copyright (c) 2023 European Journal of Pure and Applied Mathematics
![Creative Commons License](http://i.creativecommons.org/l/by-nc-sa/4.0/88x31.png)
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
$J^2$-Hop Domination in Graphs: Properties and Connections with Other Parameters. (2023). European Journal of Pure and Applied Mathematics, 16(4), 2118-2131. https://doi.org/10.29020/nybg.ejpam.v16i4.4905