Maximum nullity and zero forcing number on graphs with maximum degree at most three
From MaRDI portal
Publication:777379
DOI10.1016/j.dam.2020.03.027zbMath1443.05058arXiv1903.08614OpenAlexW3013879552MaRDI QIDQ777379
Elahe Rezaei-Sani, Meysam Alishahi, Elahe Sharifi
Publication date: 7 July 2020
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1903.08614
Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Upper bounds on the \(k\)-forcing number of a graph
- The minimum semidefinite rank of a triangle-free graph
- Zero forcing parameters and minimum rank problems
- Some bounds on the zero forcing number of a graph
- On the total forcing number of a graph
- Bounds on the connected forcing number of a graph
- Total forcing and zero forcing in claw-free cubic graphs
- Zero forcing sets and the minimum rank of graphs
- The graphs for which the maximum multiplicity of an eigenvalue is two
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph