Maximum nullity and zero forcing number of graphs with rank at most 4

DOI10.1080/23311835.2018.1437668zbMath1438.05167OpenAlexW2785986946MaRDI QIDQ5193233

Katayoun Nozari, Ebrahim Vatandoost

Publication date: 10 September 2019

Published in: Cogent Mathematics & Statistics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/23311835.2018.1437668

zbMATH Keywords

rankminimum rankmaximum nullityzero forcing number

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)

Cites Work

• Proof of a conjecture on the zero forcing number of a graph
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A characterization of graphs with rank 4
• An upper bound for the minimum rank of a graph
• The minimum rank of symmetric matrices described by a graph: a survey
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• Zero forcing sets and the minimum rank of graphs

This page was built for publication: Maximum nullity and zero forcing number of graphs with rank at most 4