Please use this identifier to cite or link to this item:
https://hdl.handle.net/1959.11/26626
Title: | The Zero Forcing Number of Graphs | Contributor(s): | Kalinowski, Thomas (author) ; Kamcev, Nina (author); Sudakov, Benny (author) | Publication Date: | 2019 | DOI: | 10.1137/17M1133051 | Handle Link: | https://hdl.handle.net/1959.11/26626 | Abstract: | 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. | Publication Type: | Journal Article | Source of Publication: | SIAM Journal on Discrete Mathematics, 33(1), p. 95-115 | Publisher: | Society for Industrial and Applied Mathematics | Place of Publication: | United States of America | ISSN: | 1095-7146 0895-4801 |
Fields of Research (FoR) 2008: | 010104 Combinatorics and Discrete Mathematics (excl. Physical Combinatorics) | Fields of Research (FoR) 2020: | 490404 Combinatorics and discrete mathematics (excl. physical combinatorics) | Socio-Economic Objective (SEO) 2008: | 970101 Expanding Knowledge in the Mathematical Sciences | Socio-Economic Objective (SEO) 2020: | 280118 Expanding knowledge in the mathematical sciences | Peer Reviewed: | Yes | HERDC Category Description: | C1 Refereed Article in a Scholarly Journal |
---|---|
Appears in Collections: | Journal Article School of Science and Technology |
Files in This Item:
File | Size | Format |
---|
SCOPUSTM
Citations
18
checked on Mar 2, 2024
Page view(s)
1,348
checked on Jun 11, 2023
Download(s)
2
checked on Jun 11, 2023
Items in Research UNE are protected by copyright, with all rights reserved, unless otherwise indicated.