The failed zero forcing number of a graph

DOI10.2140/INVOLVE.2015.8.99MaRDI QIDQ2340141zbMATH OpenOpenAlexFDO

Authors Katherine Fetcie, Daniel Saavedra, Bonnie C. Jacob

Publication date 16 April 2015

Published in Involve (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2140/involve.2015.8.99

zbMATH Keywords

graph coloringzero forcing numbervertex labeling

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15) Games on graphs (graph-theoretic aspects) (05C57) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A lower bound on the failed zero-forcing number of a graph
• Failed skew zero forcing on a graph
• Failed zero forcing and critical sets on directed graphs
• On zero forcing number of graphs and their complements
• Computing the zero forcing number for generalized Petersen graphs

Cited in

(15)

• A lower bound on the failed zero-forcing number of a graph
• Iteration index of a zero forcing set in a graph
• Blocking zero forcing processes in Cartesian products of graphs
• Failed power domination on graphs
• Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes
• On leaky forcing and resilience
• Computing the zero forcing number for generalized Petersen graphs
• Failed skew zero forcing on a graph
• The zero forcing span of a graph
• On the complexity of failed zero forcing
• Failed zero forcing and critical sets on directed graphs
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• Sparks of symmetric matrices and their graphs
• Immune sets in monotone infection rules. Characterization and complexity
• Failed zero forcing numbers of trees and circulant graphs

This page was built for publication: The failed zero forcing number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2340141)