The zero forcing number of expanded paths and cycles

DOI10.33044/REVUMA.5022MaRDI QIDQ7250384zbMATH OpenFDO

Authors Yipeng Liao, Chaohui Chen, Jia Wei, Zoran Stanić

Publication date 20 May 2026

Published in Revista de la Unión Matemática Argentina (Search for Journal in Brave)

Full work available at URL https://doi.org/10.33044/REVUMA.5022

zbMATH Keywords

cyclespliced graphexpanded cycleexpanded pathgraph nullityzero forcing set

Mathematics Subject Classification ID

Paths and cycles (05C38) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Structural characterization of families of graphs (05C75)

Cites work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• Bounds for the Zero Forcing Number of Graphs with Large Girth
• Extremal values and bounds for the zero forcing number
• Graph theory
• Nullity and singularity of a graph in which every block is a cycle
• On extremal graphs for zero forcing number
• On the nullity of bipartite graphs
• On the nullity of graphs
• Power domination in graphs
• Probabilistic zero forcing on random graphs
• Spectra of graphs
• The Zero Forcing Number of Graphs
• Zero forcing sets and the minimum rank of graphs
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks

This page was built for publication: The zero forcing number of expanded paths and cycles

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