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

DOI10.1016/J.LAA.2011.05.012zbMATH Open1241.05086OpenAlexW1974753353MaRDI QIDQ417535FDOQ417535

Authors: 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

Recommendations

Zero forcing parameters and minimum rank problems
Zero forcing sets and the minimum rank of graphs
Techniques for determining equality of the maximum nullity and the zero forcing number of a graph
Zero forcing number, path cover number, and maximum nullity of cacti
On minimum rank and zero forcing sets of a graph

zbMATH Keywords

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Paths and cycles (05C38) Vector spaces, linear dependence, rank, lineability (15A03)

Cites Work

Zero forcing sets and the minimum rank of graphs
The graphs for which the maximum multiplicity of an eigenvalue is two
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
Nondiscriminatory propagation on trees
The minimum rank of symmetric matrices described by a graph: a survey
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

Cited In (41)

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

This page was built for publication: A technique for computing the zero forcing number of a graph with a cut-vertex

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