On the relationship between the zero forcing number and path cover number for some graphs

DOI10.1007/S41980-019-00290-8MaRDI QIDQ779727zbMATH OpenOpenAlexWikidataFDO

Authors Zeinab Montazeri, Nasrin Soltankhah

Publication date 14 July 2020

Published in Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s41980-019-00290-8

zbMATH Keywords

path cover numberRook's graphzero forcing number

Mathematics Subject Classification ID

Distance in graphs (05C12) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Graph operations (line graphs, products, etc.) (05C76)

Recommendations

• Zero forcing number, path cover number, and maximum nullity of cacti
• On the relationships between zero forcing numbers and certain graph coverings
• On the zero forcing number of a graph involving some classical parameters
• Extremal values and bounds for the zero forcing number
• Zero forcing number, maximum nullity, and path cover number of subdivided graphs

Cites work

• A technique for computing the zero forcing number of a graph with a cut-vertex
• On the relationships between zero forcing numbers and certain graph coverings
• Propagation time for zero forcing on a graph
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs

Cited in

(10)

• Brushing number and zero-forcing number of graphs and their line graphs
• On the relationships between zero forcing numbers and certain graph coverings
• Zero forcing number, path cover number, and maximum nullity of cacti
• k-forcing number for Cartesian product of some graphs
• Zero forcing number, maximum nullity, and path cover number of subdivided graphs
• The zero forcing number of graphs with the matching number and the cyclomatic number
• Vertex cover zero forcing sets in graphs
• On a conjecture of \textit{TxGraffiti}: relating zero forcing and vertex covers in graphs
• The zero forcing number of claw-free cubic graphs
• An approximation algorithm for zero forcing

This page was built for publication: On the relationship between the zero forcing number and path cover number for some graphs

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