Three-state zero forcing on graphs

zbMATH Open1338.05260MaRDI QIDQ2799862FDOQ2799862

Peter Yeung, Brian Podlisny, Bonnie C. Jacob, Daniel Saavedra, Thomas Ansill

Publication date: 13 April 2016

Published in: Congressus Numerantium (Search for Journal in Brave)

zbMATH Keywords

dynamical systems on the vertex set of a graph

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85)

   Recommendations

• Probabilistic Zero Forcing in Graphs 👍 👎
• Maximum nullity and zero forcing number on graphs with maximum degree at most three 👍 👎
• The Zero Forcing Number of Graphs 👍 👎
• On graphs maximizing the zero forcing number 👍 👎
• Zero forcing in triangulations 👍 👎
• Zero forcing versus domination in cubic graphs 👍 👎
• On extremal graphs for zero forcing number 👍 👎
• On zero forcing number of graphs and their complements 👍 👎
• Some bounds on the zero forcing number of a graph 👍 👎
• Zero-forcing in random regular graphs 👍 👎

This page was built for publication: Three-state zero forcing on graphs

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