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

Vol. 17 No. 2: (April 2024)

Section

Nonlinear Analysis

License

Copyright (c) 2024 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

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