Bounds for the Zero Forcing Number of Graphs with Large Girth
The zero-forcing number, Z(G) is an upper bound for the maximum nullity of all symmetric matrices with a sparsity pattern described by the graph. A simple lower bound is δ ≤ Z(G) where δ is the minimum degree. An improvement of this bound is provided in the case that G has girth of at least 5. In pa...
Main Authors: | Randy Davila, Franklin Kenter |
---|---|
Format: | Article |
Language: | English |
Published: |
Georgia Southern University
2015-01-01
|
Series: | Theory and Applications of Graphs |
Subjects: | |
Online Access: | https://digitalcommons.georgiasouthern.edu/tag/vol2/iss2/1 |
Similar Items
-
Dynamic approach to k-forcing
by: Yair Caro, et al.
Published: (2015-01-01) -
On the Relationships between Zero Forcing Numbers and Certain Graph Coverings
by: Taklimi Fatemeh Alinaghipour, et al.
Published: (2014-02-01) -
Total Forcing Sets and Zero Forcing Sets in Trees
by: Davila Randy, et al.
Published: (2020-08-01) -
Zero forcing number of degree splitting graphs and complete degree splitting graphs
by: Dominic Charles
Published: (2019-08-01) -
Maximum Oriented Forcing Number for Complete Graphs
by: Yair Caro, et al.
Published: (2019-05-01)