k-Forcing number for Cartesian product of some graphs

DOI10.11575/cdm.v16i1.68557zbMath1458.05176OpenAlexW3155662996MaRDI QIDQ4986275

Zeinab Montazeri, Nasrin Soltankhah

Publication date: 27 April 2021

Full work available at URL: https://cdm.ucalgary.ca/article/download/68557/54771

zbMATH Keywords

\(k\)-forcing numberRook's graphgeneralized Rook's graph

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (max. 100)

Some algebraic hyperstructures related to zero forcing sets and forcing digraphs

Cites Work

• Unnamed Item
• Fast-mixed searching and related problems on graphs
• Generalized power domination of graphs
• Upper bounds on the \(k\)-forcing number of a graph
• On the relationship between the zero forcing number and path cover number for some graphs
• Zero forcing parameters and minimum rank problems
• Logic circuits from zero forcing
• Zero forcing sets and the minimum rank of graphs
• Power domination in graphs
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks

This page was built for publication: k-Forcing number for Cartesian product of some graphs