Well-failed graphs

MaRDI QIDQ6858806zbMATH OpenFDO

Authors Bonnie C. Jacob

Publication date 12 February 2026

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution-NoDerivs 4.0 International

Full work available at URL https://ajc.maths.uq.edu.au/pdf/93/ajc_v93_p359.pdf

zbMATH Keywords

maximal failed zero forcing setwell-dominated graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35)

Cites work

• Computational approaches for zero forcing and related problems
• Effects of vertex degrees on the zero-forcing number and propagation time of a graph
• scientific article; zbMATH DE number 4063149 (Why is no real title available?)
• scientific article; zbMATH DE number 1286748 (Why is no real title available?)
• Inverse Problems and Zero Forcing for Graphs
• Isomorphisms and properties of TAR graphs for zero forcing and other X-set parameters
• Minimal zero forcing sets
• On the number of minimal forts of a graph
• On the zero blocking number of rectangular, cylindrical, and Möbius grids
• On well-dominated graphs
• The failed zero forcing number of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• WELL-COVERED GRAPHS: A SURVEY
• Well-forced graphs
• Zero forcing sets and the minimum rank of graphs
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks

This page was built for publication: Well-failed graphs

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