Zero forcing number, path cover number, and maximum nullity of cacti

DOI10.2140/INVOLVE.2011.4.277zbMATH Open1246.05098OpenAlexW2056546963MaRDI QIDQ444558FDOQ444558

Authors: Darren D. Row 

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

Recommendations

• On the relationship between the zero forcing number and path cover number for some graphs
• Zero forcing parameters and minimum rank problems
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Zero forcing number, maximum nullity, and path cover number of subdivided graphs
• Minimum rank, maximum nullity and zero forcing number for selected graph families

zbMATH Keywords

cactusmaximum nullityzero forcing numbercut-vertexpath cover numbercut-edge

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vector spaces, linear dependence, rank, lineability (15A03)

Cited In (7)

• Connected power domination in graphs
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Upper bounds on the \(k\)-forcing number of a graph
• Edge Forcing in Butterfly Networks
• Complexity and computation of connected zero forcing
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• On the relationships between zero forcing numbers and certain graph coverings

This page was built for publication: Zero forcing number, path cover number, and maximum nullity of cacti

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