The zero forcing polynomial of a graph
From MaRDI portal
Publication:1732095
DOI10.1016/j.dam.2018.11.033zbMath1408.05072arXiv1801.08910OpenAlexW2785115737WikidataQ128725121 ScholiaQ128725121MaRDI QIDQ1732095
Publication date: 22 March 2019
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1801.08910
Related Items
Improved Computational Approaches and Heuristics for Zero Forcing, On the zero blocking number of rectangular, cylindrical, and Möbius grids, Blocking zero forcing processes in Cartesian products of graphs, Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters, Zero forcing with random sets, Almost unimodal and real-rooted graph polynomials
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Fractional zero forcing via three-color forcing games
- Fast-mixed searching and related problems on graphs
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Propagation time for zero forcing on a graph
- Recurrence relations and splitting formulas for the domination polynomial
- Domination polynomials of \(k\)-tree related graphs
- Zero forcing propagation time on oriented graphs
- On the edge cover polynomial of a graph
- Characterization of graphs using domination polynomials
- Positive semidefinite propagation time
- Zero forcing parameters and minimum rank problems
- Irreversible \(k\)-threshold processes: Graph-theoretical threshold models of the spread of disease and of opinion
- Clique polynomials and independent set polynomials of graphs
- The vertex-cover polynomial of a graph
- Throttling positive semidefinite zero forcing propagation time on graphs
- Logic circuits from zero forcing
- Complexity and computation of connected zero forcing
- On the roots of domination polynomials
- Positive semidefinite zero forcing
- Zero forcing for sign patterns
- Zero forcing sets and the minimum rank of graphs
- Power domination in graphs
- Graph Polynomials and Their Applications I: The Tutte Polynomial
- Graph Polynomials and Their Applications II: Interrelations and Interpretations
- The graphs for which the maximum multiplicity of an eigenvalue is two
- Using variants of zero forcing to bound the inertia set of a graph
- A polynomial invariant for knots via von Neumann algebras
- Domination in Graphs Applied to Electric Power Networks
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Introduction to Domination Polynomial of a Graph
- Dynamic approach to k-forcing
- Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
- On dichromatic polynomials
- A Decomposition for Combinatorial Geometries
