2-distance Zero Forcing Sets in Graphs

Authors

  • Javier Hassan MSU Tawi-Tawi College of Technology and Oceanography
  • Lestlene T. Udtohan
  • Ladznar S. Laja

DOI:

https://doi.org/10.29020/nybg.ejpam.v17i2.5046

Keywords:

Zero forcing set, 2-distance zero forcing set, 2-distance zero forcing number

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.

Downloads

Published

2024-04-30

Issue

Section

Nonlinear Analysis

How to Cite

2-distance Zero Forcing Sets in Graphs. (2024). European Journal of Pure and Applied Mathematics, 17(2), 1283-1293. https://doi.org/10.29020/nybg.ejpam.v17i2.5046

Similar Articles

1-10 of 578

You may also start an advanced similarity search for this article.

Most read articles by the same author(s)

1 2 3 > >>