Bounds on the Connected Forcing Number of a Graph
Authors:
- 8 October 2018
- journal article
- research article
- Published by Springer Nature in Graphs and Combinatorics
- Vol. 34 (6) , 1159-1174
Abstract
No abstract availableKeywords
All Related Versions
This publication has 22 references indexed in Scilit:
- A lower bound on the zero forcing numberDiscrete Applied Mathematics, 2018
- The forcing number of graphs with given girthQuaestiones Mathematicae, 2017
- Dynamic approach to k-forcingTheory and Applications of Graphs, 2015
- Bounds for the Zero Forcing Number of Graphs with Large GirthTheory and Applications of Graphs, 2015
- Upper bounds on the-forcing number of a graphDiscrete Applied Mathematics, 2015
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a GraphJournal of Graph Theory, 2012
- On the graph complement conjecture for minimum rankLinear Algebra and its Applications, 2012
- Zero forcing sets and the minimum rank of graphsLinear Algebra and its Applications, 2008
- Full Control by Locally Induced RelaxationPhysical Review Letters, 2007
- Girth and treewidthJournal of Combinatorial Theory, Series B, 2005