ON THE ZERO FORCING NUMBER OF GENERALIZED SIERPINSKI GRAPHS

被引：3
|
作者：
Vatandoost, Ebrahim [1 ]
Ramezani, Fatemeh [2 ]
Alikhani, Saeid [2 ]
机构：
[1] Imam Khomeini Int Univ, Dept Basic Sci, Qazvin, Iran
[2] Yazd Univ, Dept Math, POB 89195-741, Yazd, Iran
来源：
TRANSACTIONS ON COMBINATORICS | 2019年 / 8卷 / 01期
关键词：
Zero forcing number; generalized Sierpinski graph; Sierpinski graph; path covering; MINIMUM RANK; DIMENSION; CODES; SETS;
D O I：
10.22108/toc.2018.101107.1463
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
In this article we study the Zero forcing number of Generalized Sierpinski graphs S(G, t). More precisely, we obtain a general lower bound on the Zero forcing number of S(G, t) and we show that this bound is tight. In particular, we consider the cases in which the base graph G is a star, path, a cycle or a complete graph.
引用
收藏
页码：41 / 50
页数：10
相关论文
共 50 条
  • [41] A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
    Eroh, Linda
    Kang, Cong X.
    Yi, Eunjeong
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2017, 33 (06) : 731 - 747
  • [42] A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
    Linda EROH
    Cong X.KANG
    Eunjeong YI
    Acta Mathematica Sinica,English Series, 2017, 33 (06) : 731 - 747
  • [43] A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
    Linda Eroh
    Cong X. Kang
    Eunjeong Yi
    Acta Mathematica Sinica, English Series, 2017, 33 : 731 - 747
  • [44] Maximum nullity and zero forcing number on graphs with maximum degree at most three
    Alishahi, Meysam
    Rezaei-Sani, Elahe
    Sharifi, Elahe
    DISCRETE APPLIED MATHEMATICS, 2020, 284 : 179 - 194
  • [45] A Comparison between the Metric Dimension and Zero Forcing Number of Trees and Unicyclic Graphs
    Linda EROH
    Cong XKANG
    Eunjeong YI
    ActaMathematicaSinica, 2017, 33 (06) : 731 - 747
  • [46] On the Zero Forcing Number of Trees
    Oboudi, Mohammad Reza
    IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE, 2021, 45 (03): : 1065 - 1070
  • [47] On the Zero Forcing Number of Trees
    Mohammad Reza Oboudi
    Iranian Journal of Science and Technology, Transactions A: Science, 2021, 45 : 1065 - 1070
  • [48] On the cop number of Sierpinski-like graphs
    Cakmak, Nazlican
    Akyar, Emrah
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2024, 16 (04)
  • [49] The Hub Number of Sierpinski-Like Graphs
    Lin, Chien-Hung
    Liu, Jia-Jie
    Wang, Yue-Li
    Yen, William Chung-Kung
    THEORY OF COMPUTING SYSTEMS, 2011, 49 (03) : 588 - 600
  • [50] Probabilistic zero forcing on random graphs
    English, Sean
    MacRury, Calum
    Pralat, Pawel
    EUROPEAN JOURNAL OF COMBINATORICS, 2021, 91
12345