2-distance Zero Forcing Sets in Graphs
-
Published:2024-04-30
Issue:2
Volume:17
Page:1283-1293
-
ISSN:1307-5543
-
Container-title:European Journal of Pure and Applied Mathematics
-
language:
-
Short-container-title:Eur. J. Pure Appl. Math.
Author:
Hassan Javier,Udtohan Lestlene T.,Laja Ladznar S.
Abstract
In this paper, we introduce new concept in graph theory called 2-distance zero forcing. We give some properties of this new parameter and investigate its connections with other parameters such as zero forcing and hop domination. We show that 2-distance zero forcing and hop domination (respectively, zero forcing parameter) are incomparable. Moreover, we characterize 2-distance zero forcing sets in some special graphs, and finally derive the exact values or bounds of the parameter using these results.
Publisher
New York Business Global LLC