Connected zero forcing sets and connected propagation time of graphs

DOI10.22108/toc.2020.115286.1617zbMath1463.05405arXiv1702.06711OpenAlexW3010673472MaRDI QIDQ5139339

Alemeh Sheikhhosseini, Maryam Khosravi, Saeedeh Rashidi

Publication date: 8 December 2020

Full work available at URL: https://arxiv.org/abs/1702.06711

zbMATH Keywords

zero forcing numberpropagation timeconnected zero forcing number

Mathematics Subject Classification ID

Distance in graphs (05C12) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)

Related Items (2)

Unnamed Item ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Propagation time for zero forcing on a graph
• Minimum rank problems
• On minimum rank and zero forcing sets of a graph
• Zero forcing parameters and minimum rank problems
• The minimum rank of symmetric matrices described by a graph: a survey
• Positive semidefinite zero forcing
• Zero forcing sets and the minimum rank of graphs
• Iteration Index of a Zero Forcing Set in a Graph
• Positive semidefinite maximum nullity and zero forcing number
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• The graphs for which the maximum multiplicity of an eigenvalue is two
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph

This page was built for publication: Connected zero forcing sets and connected propagation time of graphs