Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph

DOI10.1016/j.laa.2010.10.015zbMath1241.05076OpenAlexW2002518435MaRDI QIDQ417526

My Huynh, Leslie Hogben, Christina J. Edholm, Darren D. Row, Joshua LaGrange

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.2010.10.015

zbMATH Keywords

triangular gridgrid graphminimum rankmaximum nullityzero forcing numberKing gridnull spreadrank spreadsupertrianglezero spread

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

Related Items (52)

On the semitotal forcing number of a graph ⋮ Computational approaches for zero forcing and related problems ⋮ Using a new zero forcing process to guarantee the strong Arnold property ⋮ Proof of a conjecture on the zero forcing number of a graph ⋮ Extremal values and bounds for the zero forcing number ⋮ Computational and Theoretical Challenges for Computing the Minimum Rank of a Graph ⋮ Multi-color forcing in graphs ⋮ A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs ⋮ On the length of L-Grundy sequences ⋮ Total forcing sets and zero forcing sets in trees ⋮ On the spectrum and energy of singular graphs ⋮ On the Energy of Graphs ⋮ Extremal \(k\)-forcing sets in oriented graphs ⋮ Zero forcing and maximum nullity for hypergraphs ⋮ On tight bounds for the \(k\)-forcing number of a graph ⋮ Some bounds on the zero forcing number of a graph ⋮ Restricted power domination and zero forcing problems ⋮ Connected power domination in graphs ⋮ A technique for computing the zero forcing number of a graph with a cut-vertex ⋮ Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters ⋮ The zero forcing number of graphs with the matching number and the cyclomatic number ⋮ Bounding the total forcing number of graphs ⋮ Unnamed Item ⋮ Positive semidefinite zero forcing ⋮ Propagation time for zero forcing on a graph ⋮ Counterexamples to an edge spread question for zero forcing number ⋮ Unnamed Item ⋮ On the total forcing number of a graph ⋮ Upper bounds on the \(k\)-forcing number of a graph ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ The forcing number of graphs with given girth ⋮ On leaky forcing and resilience ⋮ Bounds on the connected forcing number of a graph ⋮ Total forcing and zero forcing in claw-free cubic graphs ⋮ Total forcing versus total domination in cubic graphs ⋮ 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 ⋮ Maximum nullity and zero forcing number of graphs with rank at most 4 ⋮ On the zero forcing number of generalized Sierpinski graphs ⋮ On the zero forcing number of a graph involving some classical parameters ⋮ Effects of vertex degrees on the zero-forcing number and propagation time of a graph ⋮ A lower bound on the zero forcing number ⋮ Zero forcing number of a graph in terms of the number of pendant vertices ⋮ Matching, path covers, and total forcing sets ⋮ Grundy domination and zero forcing in Kneser graphs ⋮ Zero forcing in claw-free cubic graphs ⋮ Note on forcing problem of trees ⋮ Line graphs: Their maximum nullities and zero forcing numbers ⋮ Positive semidefinite zero forcing numbers of two classes of graphs ⋮ A computational comparison of compact MILP formulations for the zero forcing number ⋮ On zero forcing number of graphs and their complements

Cites Work

• Minimum rank problems
• Maximum nullity of outerplanar graphs and the path cover number
• On minimum rank and zero forcing sets of a graph
• Techniques for determining the minimum rank of a small graph
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Multiplicities of eigenvalues and tree-width of graphs
• Computation of minimal rank and path cover number for certain graphs
• Zero forcing sets and the minimum rank of graphs
• Minimum-rank matrices with prescribed graph
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs

This page was built for publication: Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph