The zero forcing polynomial of a graph
Authors:
- Kirk BoyerKBKirk Boyer
- Boris BrimkovBBBoris Brimkov
- Sean EnglishSESean English
- Daniela FerreroDFDaniela Ferrero
- Ariel KellerAKAriel Keller
- Rachel KirschRKRachel Kirsch
- Michael PhillipsMPMichael Phillips
- Carolyn ReinhartCRCarolyn Reinhart
- 1 April 2019
- journal article
- research article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 258, 35-48
Abstract
No abstract availableKeywords
All Related Versions
Funding Information
- NSF-DMS, United States (1604458, 1604773, 1604697, 1603823)
- Simons Foundation Collaboration, United States (316262)
This publication has 31 references indexed in Scilit:
- On the Roots of Domination PolynomialsGraphs and Combinatorics, 2013
- A technique for computing the zero forcing number of a graph with a cut-vertexLinear Algebra and its Applications, 2012
- The graphs for which the maximum multiplicity of an eigenvalue is twoLinear and Multilinear Algebra, 2009
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007
- Power domination in graphsDiscrete Mathematics, 2006
- Clique polynomials and independent set polynomials of graphsDiscrete Mathematics, 1994
- A polynomial invariant for knots via von Neumann algebrasBulletin of the American Mathematical Society, 1985
- A decomposition for combinatorial geometriesTransactions of the American Mathematical Society, 1972
- A logical expansion in mathematicsBulletin of the American Mathematical Society, 1932
- A Determinant Formula for the Number of Ways of Coloring a MapAnnals of Mathematics, 1912