On the relationships between zero forcing numbers and certain graph coverings

DOI10.2478/spma-2014-0004zbMath1291.05126arXiv1311.7064MaRDI QIDQ2017194

Fatemeh Alinaghipour Taklimi, Karen Meagher, Shaun M. Fallat

Publication date: 25 June 2014

Published in: Special Matrices (Search for Journal in Brave)

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

zbMATH Keywords

positive zero forcing number; zero forcing number; path cover number; tree cover number

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

15B35: Sign pattern matrices

Related Items

On the relationship between the zero forcing number and path cover number for some graphs, Grundy dominating sequences and zero forcing sets, Effects of vertex degrees on the zero-forcing number and propagation time of a graph, Vector representations of graphs and distinguishing quantum product states with one-way LOCC, Grundy domination and zero forcing in regular graphs

Cites Work

• Unnamed Item
• Fast-mixed searching and related problems on graphs
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Zero forcing number, path cover number, and maximum nullity of cacti
• Minimum rank, maximum nullity and zero forcing number for selected graph families
• Linearly independent vertices and minimum semidefinite rank
• On minimum rank and zero forcing sets of a graph
• Zero forcing parameters and minimum rank problems
• Positive semidefinite zero forcing
• Zero forcing sets and the minimum rank of graphs
• On the difference between the maximum multiplicity and path cover number for tree-like graphs
• Minimum semidefinite rank of outerplanar graphs and the tree cover number
• Note on positive semidefinite maximum nullity and positive semidefinite zero forcing number of partial 2-trees
• The graphs for which the maximum multiplicity of an eigenvalue is two
• Nondiscriminatory propagation on trees
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks