Some properties of the closed global shadow graphs and their zero forcing number

被引：0
|
作者：
Raksha, M. R. [1 ]
Dominic, Charles [1 ]
机构：
[1] CHRIST Deemed Univ, Dept Math, Bangalore 560029, Karnataka, India
来源：
ACTA UNIVERSITATIS SAPIENTIAE INFORMATICA | 2022年 / 14卷 / 01期
关键词：
zero forcing number; zero forcing set; closed global shadow graph; open global shadow graph; MINIMUM RANK; DOMINATION;
D O I：
10.2478/ausi-2022-0009
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
Zero forcing is one of the dynamic vertex coloring problem. Zero forcing number is the minimum cardinality of the zero forcing sets. This parameter is the upper bound for the maximum nullity. A new class of graph where the maximum nullity is equal to the zero forcing number of the graph is defined as closed global shadow graph. Basic properties and zero forcing number of this graph class is analysed.
引用
收藏
页码：137 / 154
页数：18
相关论文
共 50 条
  • [1] Global Forcing Number of Some Chemical Graphs
    Cai, Jinzhuan
    Zhang, Heping
    MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2012, 67 (02) : 289 - 312
  • [2] Zero forcing number for Cartesian product of some graphs
    Montazeri, Zeinab
    Soltankhah, Nasrin
    COMMUNICATIONS IN COMBINATORICS AND OPTIMIZATION, 2024, 9 (04) : 635 - 646
  • [3] THE ZERO FORCING NUMBER OF GRAPHS
    Kalinowski, Thomas
    Kamcev, Nina
    Sudakov, Benny
    SIAM JOURNAL ON DISCRETE MATHEMATICS, 2019, 33 (01) : 95 - 115
  • [4] On the zero forcing number of graphs and their splitting graphs
    Chacko, Baby
    Dominic, Charles
    Premodkumar, K. P.
    ALGEBRA AND DISCRETE MATHEMATICS, 2019, 28 (01): : 29 - 43
  • [5] On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs
    Montazeri, Zeinab
    Soltankhah, Nasrin
    BULLETIN OF THE IRANIAN MATHEMATICAL SOCIETY, 2020, 46 (03) : 767 - 776
  • [6] On the Relationship Between the Zero Forcing Number and Path Cover Number for Some Graphs
    Zeinab Montazeri
    Nasrin Soltankhah
    Bulletin of the Iranian Mathematical Society, 2020, 46 : 767 - 776
  • [7] On graphs maximizing the zero forcing number
    Liang, Yi-Ping
    Xu, Shou-Jun
    DISCRETE APPLIED MATHEMATICS, 2023, 334 : 81 - 90
  • [8] On Extremal Graphs for Zero Forcing Number
    Liang, Yi-Ping
    Li, Jianxi
    Xu, Shou-Jun
    GRAPHS AND COMBINATORICS, 2022, 38 (06)
  • [9] On Extremal Graphs for Zero Forcing Number
    Yi-Ping Liang
    Jianxi Li
    Shou-Jun Xu
    Graphs and Combinatorics, 2022, 38
  • [10] On zero forcing number of graphs and their complements
    Eroh, Linda
    Kang, Cong X.
    Yi, Eunjeong
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (01)
12345