A technique for computing the zero forcing number of a graph with a cut-vertex

DOI10.1016/j.laa.2011.05.012zbMath1241.05086MaRDI QIDQ417535

Darren D. Row

Publication date: 14 May 2012

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2011.05.012

zbMATH Keywords

unicyclic graphs; maximum nullity; zero forcing number; cut-vertex reduction; zero spread

Mathematics Subject Classification ID

05C38: Paths and cycles

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

15A03: Vector spaces, linear dependence, rank, lineability

Related Items

Zero forcing number of a graph in terms of the number of pendant vertices, Unnamed Item, GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED, Failed power domination on graphs, On the zero forcing number of generalized Sierpinski graphs, On zero forcing number of graphs and their complements, On graphs maximizing the zero forcing number, Open global shadow graph and it’s zero forcing number, Zero forcing with random sets, Extremal values and bounds for the zero forcing number, Propagation time for zero forcing on a graph, Upper bounds on the \(k\)-forcing number of a graph, Maximum nullity and zero forcing number on graphs with maximum degree at most three, On the relationship between the zero forcing number and path cover number for some graphs, Positive semidefinite propagation time, Computational approaches for zero forcing and related problems, Families of graphs with maximum nullity equal to zero forcing number, Some bounds on the zero forcing number of a graph, The zero forcing polynomial of a graph, Rigid linkages and partial zero forcing, Complexity and computation of connected zero forcing, On the relationships between zero forcing numbers and certain graph coverings, Zero forcing versus domination in cubic graphs, On extremal graphs for zero forcing number, On the zero forcing number and spectral radius of graphs, On trees and unicyclic graphs with equal forcing-type numbers, Properties of a \(q\)-analogue of zero forcing, On leaky forcing and resilience, On the zero forcing number of a graph involving some classical parameters, Zero forcing number of degree splitting graphs and complete degree splitting graphs, Positive semidefinite zero forcing numbers of two classes of graphs, A computational comparison of compact MILP formulations for the zero forcing number, Extremal \(k\)-forcing sets in oriented graphs, On tight bounds for the \(k\)-forcing number of a graph, Zero forcing in triangulations, Restricted power domination and zero forcing problems, Line graphs: Their maximum nullities and zero forcing numbers

Cites Work

• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• Minimum rank problems
• On minimum rank and zero forcing sets of a graph
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Zero forcing sets and the minimum rank of graphs
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• The graphs for which the maximum multiplicity of an eigenvalue is two
• Nondiscriminatory propagation on trees