On the zero forcing number of trees

DOI10.1007/S40995-021-01112-5MaRDI QIDQ7232757zbMATH OpenFDO

Authors Mohammad Reza Oboudi

Publication date 23 April 2026

Published in Iranian Journal of Science and Technology. Transaction A: Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S40995-021-01112-5

zbMATH Keywords

maximum nullityminimum ranktreezero forcing number

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Domination in Graphs Applied to Electric Power Networks
• Logic circuits from zero forcing
• Orthogonal representations and connectivity of graphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Power domination in graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• Upper bounds on the \(k\)-forcing number of a graph
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: On the zero forcing number of trees

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