THE ZERO FORCING NUMBER OF GRAPHS

被引：25

作者：

Kalinowski, Thomas ^{[1
]}

Kamcev, Nina ^{[2
]}

Sudakov, Benny ^{[2
]}

机构：

[1] Univ New England, Sch Sci & Technol, Armidale, NSW 2351, Australia

[2] ETH, Dept Math, CH-8092 Zurich, Switzerland

来源：

SIAM JOURNAL ON DISCRETE MATHEMATICS | 2019年 / 33卷 / 01期

关键词：

zero forcing sets; random graphs; graphs with large girth; MINIMUM RANK; VALUES; BOUNDS;

D O I：

10.1137/17M1133051

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

A subset S of initially infected vertices of a graph G is called zero forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infected vertex which has a unique uninfected neighbor, infects this neighbor. The zero forcing number of G is the minimum cardinality of a zero forcing set in G. We study the zero forcing number of various classes of graphs, including graphs of large girth, H-free graphs for a fixed bipartite graph H, and random and pseudorandom graphs.

引用

页码：95 / 115

页数：21

共 50 条

[1] On the zero forcing number of graphs and their splitting graphs
Chacko, Baby
Dominic, Charles
Premodkumar, K. P.
[J]. ALGEBRA AND DISCRETE MATHEMATICS, 2019, 28 (01): : 29 - 43
[2] On graphs maximizing the zero forcing number
Liang, Yi-Ping
Xu, Shou-Jun
[J]. DISCRETE APPLIED MATHEMATICS, 2023, 334 : 81 - 90
[3] On Extremal Graphs for Zero Forcing Number
Yi-Ping Liang
Jianxi Li
Shou-Jun Xu
[J]. Graphs and Combinatorics, 2022, 38
[4] On Extremal Graphs for Zero Forcing Number
Liang, Yi-Ping
Li, Jianxi
Xu, Shou-Jun
[J]. GRAPHS AND COMBINATORICS, 2022, 38 (06)
[5] On zero forcing number of graphs and their complements
Eroh, Linda
Kang, Cong X.
Yi, Eunjeong
[J]. DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2015, 7 (01)
[6] Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs
Aras Erzurumluoğlu
Karen Meagher
David Pike
[J]. Graphs and Combinatorics, 2018, 34 : 1279 - 1294
[7] Brushing Number and Zero-Forcing Number of Graphs and Their Line Graphs
Erzurumluoglu, Aras
Meagher, Karen
Pike, David
[J]. GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1279 - 1294
[8] The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number
Yu Jing
Wenqian Zhang
Shengjin Ji
[J]. Graphs and Combinatorics, 2023, 39
[9] The Zero Forcing Number of Graphs with the Matching Number and the Cyclomatic Number
Jing, Yu
Zhang, Wenqian
Ji, Shengjin
[J]. GRAPHS AND COMBINATORICS, 2023, 39 (04)
[10] ON THE ZERO FORCING NUMBER OF GENERALIZED SIERPINSKI GRAPHS
Vatandoost, Ebrahim
Ramezani, Fatemeh
Alikhani, Saeid
[J]. TRANSACTIONS ON COMBINATORICS, 2019, 8 (01) : 41 - 50

← 1 2 3 4 5 →