A technique for computing the zero forcing number of a graph with a cut-vertex
From MaRDI portal
Publication:417535
DOI10.1016/j.laa.2011.05.012zbMath1241.05086OpenAlexW1974753353MaRDI QIDQ417535
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
Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)
Related Items (37)
On the zero forcing number and spectral radius of graphs ⋮ GRAPHS WITH TOTAL FORCING NUMBER TWO, REVISITED ⋮ Computational approaches for zero forcing and related problems ⋮ Extremal values and bounds for the zero forcing number ⋮ Families of graphs with maximum nullity equal to zero forcing number ⋮ On trees and unicyclic graphs with equal forcing-type numbers ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ On tight bounds for the \(k\)-forcing number of a graph ⋮ Zero forcing in triangulations ⋮ Positive semidefinite propagation time ⋮ Some bounds on the zero forcing number of a graph ⋮ Restricted power domination and zero forcing problems ⋮ On graphs maximizing the zero forcing number ⋮ Open global shadow graph and it’s zero forcing number ⋮ Zero forcing with random sets ⋮ Propagation time for zero forcing on a graph ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Properties of a \(q\)-analogue of zero forcing ⋮ The zero forcing polynomial of a graph ⋮ On leaky forcing and resilience ⋮ Rigid linkages and partial zero forcing ⋮ Complexity and computation of connected zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ Failed power domination on graphs ⋮ Zero forcing versus domination in cubic graphs ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Zero forcing number of a graph in terms of the number of pendant vertices ⋮ Zero forcing number of degree splitting graphs and complete degree splitting graphs ⋮ Unnamed Item ⋮ Line graphs: Their maximum nullities and zero forcing numbers ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ 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 ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On zero forcing number of graphs and their complements ⋮ On extremal graphs for zero forcing number
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
This page was built for publication: A technique for computing the zero forcing number of a graph with a cut-vertex
