Positive Zero Forcing and Edge Clique Coverings

Author(s):  
Shaun Fallat ◽  
Karen Meagher ◽  
Abolghasem Soltani ◽  
Boting Yang
Keyword(s):  
2014 ◽  
Vol 2 (1) ◽  
Author(s):  
Fatemeh Alinaghipour Taklimi ◽  
Shaun Fallat ◽  
Karen Meagher

AbstractThe zero forcing number and the positive zero forcing number of a graph are two graph parameters that arise from two types of graph colourings. The zero forcing number is an upper bound on the minimum number of induced paths in the graph that cover all the vertices of the graph, while the positive zero forcing number is an upper bound on the minimum number of induced trees in the graph needed to cover all the vertices in the graph. We show that for a block-cycle graph the zero forcing number equals the path cover number.We also give a purely graph theoretical proof that the positive zero forcing number of any outerplanar graphs equals the tree cover number of the graph. These ideas are then extended to the setting of k-trees, where the relationship between the positive zero forcing number and the tree cover number becomes more complex.


2018 ◽  
Vol 734 ◽  
pp. 119-130 ◽  
Author(s):  
Shaun Fallat ◽  
Karen Meagher ◽  
Abolghasem Soltani ◽  
Boting Yang
Keyword(s):  

2015 ◽  
Vol E98.B (2) ◽  
pp. 352-359 ◽  
Author(s):  
Ping WANG ◽  
Lei DING ◽  
Huifang PANG ◽  
Fuqiang LIU ◽  
Nguyen Ngoc VAN

2015 ◽  
Author(s):  
Kevin Francis Palmowski
Keyword(s):  

2013 ◽  
Vol 33 (3) ◽  
pp. 628-630
Author(s):  
Zhiyu ZHANG ◽  
Min LI
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document