2-Distance Zero Forcing Sets in Graphs

被引：0
|
作者：
Hassan, Javier A. [1 ]
Udtohan, Lestlene T. [1 ]
Laja, Ladznar S. [1 ]
机构：
[1] MSU Tawi Tawi Coll Technol & Oceanog, Coll Arts & Sci, Math & Sci Dept, Bongao, Tawi Tawi, Philippines
来源：
EUROPEAN JOURNAL OF PURE AND APPLIED MATHEMATICS | 2024年 / 17卷 / 02期
关键词：
Zero forcing; 2-distance zero forcing; 2-distance zero forcing number; HOP DOMINATING SEQUENCES; CONNECTIONS;
D O I：
10.29020/nybg.ejpam.v17i2.5046
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
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.
引用
收藏
页码：1283 / 1293
页数：11
相关论文
共 50 条
  • [41] Minimum 2-distance coloring of planar graphs and channel assignment
    Junlei Zhu
    Yuehua Bu
    Journal of Combinatorial Optimization, 2018, 36 : 55 - 64
  • [42] 2-Distance coloring of planar graphs with maximum degree 5
    Chen, Ming
    Jiang, Lu
    Wang, Min
    Zhou, Shan
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2025, 17 (01)
  • [43] 2-distance (Δ+2)-coloring of planar graphs with girth six and Δ ≥ 18
    Borodin, O. V.
    Ivanova, A. O.
    DISCRETE MATHEMATICS, 2009, 309 (23-24) : 6496 - 6502
  • [44] Minimum 2-distance coloring of planar graphs and channel assignment
    Zhu, Junlei
    Bu, Yuehua
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2018, 36 (01) : 55 - 64
  • [45] List 2-distance Coloring of Planar Graphs with Girth Five
    Yin-dong Jin
    Lian-ying Miao
    Acta Mathematicae Applicatae Sinica, English Series, 2022, 38 : 540 - 548
  • [46] TOTAL FORCING SETS AND ZERO FORCING SETS IN TREES
    Davila, Randy
    Henning, Michael A.
    DISCUSSIONES MATHEMATICAE GRAPH THEORY, 2020, 40 (03) : 733 - 754
  • [47] A Graph Machine Learning Framework to Compute Zero Forcing Sets in Graphs
    Ahmad, Obaid Ullah
    Shabbir, Mudassir
    Abbas, Waseem
    Koutsoukos, Xenofon
    IEEE TRANSACTIONS ON NETWORK SCIENCE AND ENGINEERING, 2024, 11 (02): : 2110 - 2123
  • [48] Strong Structural Controllability of Directed Graphs via Zero Forcing Sets
    Park, Nam-Jin
    Kim, Yeong-Ung
    Ahn, Hyo-Sung
    IFAC PAPERSONLINE, 2023, 56 (02): : 3441 - 3446
  • [49] 2-Domination Zero Forcing in Graphs
    Hassan, Javier A.
    Laja, Ladznar S.
    Copel, Hounam B.
    INTERNATIONAL JOURNAL OF MATHEMATICS AND COMPUTER SCIENCE, 2024, 19 (04): : 1065 - 1070
  • [50] An improved bound for 2-distance coloring of planar graphs with girth six
    Deniz, Zakir
    DISCRETE APPLIED MATHEMATICS, 2025, 361 : 121 - 135
12345