The zero (total) forcing number and covering number of trees

DOI10.11650/tjm/240305zbMATH Open1548.05275MaRDI QIDQ6614498

Jianxi Li, Wai Chee Shiu, Dongxin Tu

Publication date: 7 October 2024

Published in: Taiwanese Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

treecovering numberzero forcing numbertotal forcing number

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• Title not available (Why is that?)
• Upper bounds on the \(k\)-forcing number of a graph
• On the total forcing number of a graph
• Total forcing and zero forcing in claw-free cubic graphs
• A lower bound on the zero forcing number
• On the zero forcing number and spectral radius of graphs
• Total forcing sets and zero forcing sets in trees
• Zero forcing sets and the minimum rank of graphs
• The forcing number of graphs with given girth
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Zero forcing number of a graph in terms of the number of pendant vertices
• Bounds for the Zero Forcing Number of Graphs with Large Girth

This page was built for publication: The zero (total) forcing number and covering number of trees

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