Zero forcing number, path cover number, and maximum nullity of cacti
From MaRDI portal
Publication:444558
DOI10.2140/involve.2011.4.277zbMath1246.05098OpenAlexW2056546963MaRDI QIDQ444558
Publication date: 15 August 2012
Published in: Involve (Search for Journal in Brave)
Full work available at URL: http://msp.berkeley.edu/involve/2011/4-3/p06.xhtml
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (5)
Connected power domination in graphs ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Complexity and computation of connected zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ Edge Forcing in Butterfly Networks
This page was built for publication: Zero forcing number, path cover number, and maximum nullity of cacti
