Fractional zero forcing via three-color forcing games

DOI10.1016/j.dam.2016.05.004zbMath1344.05062arXiv1509.02883OpenAlexW2206067522MaRDI QIDQ313806

Mohammad Hasan, M. Dambrine

Publication date: 12 September 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

fractionalpositive semidefiniteskewzero forcing

Mathematics Subject Classification ID

Games involving graphs (91A43) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (5)

Computational approaches for zero forcing and related problems ⋮ Zero forcing and maximum nullity for hypergraphs ⋮ The zero forcing polynomial of a graph ⋮ Zero forcing propagation time on oriented graphs ⋮ Complexity and computation of connected zero forcing

Cites Work

• Unnamed Item
• Propagation time for zero forcing on a graph
• Upper bounds on the \(k\)-forcing number of a graph
• Positive semidefinite propagation time
• Minimum rank of skew-symmetric matrices described by a graph
• Zero forcing parameters and minimum rank problems
• Zero forcing sets and the minimum rank of graphs
• Positive semidefinite maximum nullity and zero forcing number
• Orthogonal Representations, Projective Rank, and Fractional Minimum Positive Semidefinite Rank: Connections and New Directions
• Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
• Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
• Minimum rank with zero diagonal

This page was built for publication: Fractional zero forcing via three-color forcing games