Spectral bounds for the zero forcing number of a graph

DOI10.7151/DMGT.2482MaRDI QIDQ6985899zbMATH OpenFDO

Authors Hongzhang Chen, Jianxi Li, S. J. Xu

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2482

zbMATH Keywords

boundeigenvaluezero forcing number

Mathematics Subject Classification ID

Connectivity (05C40) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18)

Cites work

• Dynamic approach to k-forcing
• Graph theory with applications
• scientific article; zbMATH DE number 964896 (Why is no real title available?)
• On the zero forcing number and spectral radius of graphs
• Some bounds on the zero forcing number of a graph
• Spectra of graphs
• The Zero Forcing Number of Graphs
• Upper bounds on the \(k\)-forcing number of a graph
• Zero forcing sets and the minimum rank of graphs
• Zero forcing versus domination in cubic graphs

Cited in

(3)

• Some results on the k-alliance and domination of graphs
• The extremal results for forcing problem of trees
• Clique trees with a given zero forcing number maximizing the A_-spectral radius

This page was built for publication: Spectral bounds for the zero forcing number of a graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6985899)