Pregled bibliografske jedinice broj: 1252726
The Zero Forcing Number of Graphs
The Zero Forcing Number of Graphs // SIAM Journal on Discrete Mathematics, 33 (2019), 1; 95-115 doi:10.1137/17m1133051 (međunarodna recenzija, članak, znanstveni)
CROSBI ID: 1252726 Za ispravke kontaktirajte CROSBI podršku putem web obrasca
Naslov
The Zero Forcing Number of Graphs
Autori
Kalinowski, Thomas ; Kamčev, Nina ; Sudakov, Benny
Izvornik
SIAM Journal on Discrete Mathematics (0895-4801) 33
(2019), 1;
95-115
Vrsta, podvrsta i kategorija rada
Radovi u časopisima, članak, znanstveni
Ključne riječi
zero forcing
Sažetak
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.
Izvorni jezik
Engleski
Znanstvena područja
Matematika
Citiraj ovu publikaciju:
Časopis indeksira:
- Current Contents Connect (CCC)
- Web of Science Core Collection (WoSCC)
- Science Citation Index Expanded (SCI-EXP)
- SCI-EXP, SSCI i/ili A&HCI
- Scopus
