On the zero forcing number and spectral radius of graphs
From MaRDI portal
Publication:2121770
DOI10.37236/10638zbMath1493.05203OpenAlexW4213421977MaRDI QIDQ2121770
Publication date: 4 April 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/10638
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal values and bounds for the zero forcing number
- 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
- Spectra of graphs
- Zero forcing parameters and minimum rank problems
- Graphs with given diameter maximizing the spectral radius
- Some bounds on the zero forcing number of a graph
- Zero forcing number, Grundy domination number, and their variants
- Grundy dominating sequences and zero forcing sets
- A lower bound on the zero forcing number
- On the spectral radius of graphs with cut vertices
- Maximal distance spectral radius of 4-chromatic planar graphs
- Zero forcing versus domination in cubic graphs
- Probabilistic zero forcing on random graphs
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- Dynamical Processes on Complex Networks
- On the Spectral Radius of Complementary Acyclic Matrices of Zeros and Ones
- The Zero Forcing Number of Graphs
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Zero forcing number of a graph in terms of the number of pendant vertices
- Bounds for the Zero Forcing Number of Graphs with Large Girth
- Dynamic approach to k-forcing
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- The number of labeled k-dimensional trees
This page was built for publication: On the zero forcing number and spectral radius of graphs
