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

DOI10.1007/S41980-019-00290-8zbMATH Open1443.05159OpenAlexW3000046330WikidataQ126404012 ScholiaQ126404012MaRDI QIDQ779727FDOQ779727

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

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

zbMATH Keywords

zero forcing numberpath cover numberRook's graph

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)

Cites Work

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

Cited In (3)

• The zero forcing number of graphs with the matching number and the cyclomatic number
• The zero forcing number of claw-free cubic graphs
• k-Forcing number for Cartesian product of some graphs

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)