On the zero forcing number of a graph involving some classical parameters

Shuchao Li () and Wanting Sun ()
Additional contact information
Shuchao Li: Central China Normal University
Wanting Sun: Central China Normal University

Journal of Combinatorial Optimization, 2020, vol. 39, issue 2, No 5, 365-384

Abstract: Abstract Given a simple graph G, let $$Z(G),\, p(G),\, \Phi (G), ex(G)$$Z(G),p(G),Φ(G),ex(G) and M(G), respectively, be the zero forcing number, the number of pendant vertices, the cyclomatic number, the number of exterior major vertices and the maximum nullity of G. Wang et al. (Linear Multilinear Algebra, 2018. https://doi.org/10.1080/03081087.2018.1545829) established upper and lower bounds on Z(G) with respect to $$p(G),\, ex(G)$$p(G),ex(G) and $$\Phi (G)$$Φ(G): $$p(G)-ex(G)-1\leqslant Z(G)\leqslant p(G)+2\Phi (G)+1$$p(G)-ex(G)-1⩽Z(G)⩽p(G)+2Φ(G)+1. Hence, it is interesting to study the distribution of the zero forcing number Z(G) in the interval $$[p(G)-ex(G)-1,\, p(G)+2\Phi (G)+1]$$[p(G)-ex(G)-1,p(G)+2Φ(G)+1]. Wang et al. (2018) determined all the connected graphs G with $$Z(G)=p(G)-ex(G)$$Z(G)=p(G)-ex(G) and $$Z(G)=p(G)+2\Phi (G)-1.$$Z(G)=p(G)+2Φ(G)-1. In this paper we identify all the connected graphs G with $$Z(G)=p(G)-ex(G)+1$$Z(G)=p(G)-ex(G)+1 and $$Z(G)=p(G)+2\Phi (G)-2.$$Z(G)=p(G)+2Φ(G)-2. On the other hand, ‘AIM Minimum Rank-Special Graphs Work Group’ (Linear Algebra Appl 428(7):1628–1648, 2008) established the inequality $$Z(G)\geqslant M(G)$$Z(G)⩾M(G). The authors posted an attractive question: What is the class of graphs G for which $$Z(G)=M(G)$$Z(G)=M(G)? In this paper, we show that the equality holds for threshold graphs.

Keywords: Zero forcing number; Pendant vertex; Cyclomatic number; Maximum nullity; Threshold graph; 05C35; 05C12 (search for similar items in EconPapers)
Date: 2020
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10878-019-00475-1 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jcomop:v:39:y:2020:i:2:d:10.1007_s10878-019-00475-1

Ordering information: This journal article can be ordered from
https://www.springer.com/journal/10878

DOI: 10.1007/s10878-019-00475-1

Access Statistics for this article

Journal of Combinatorial Optimization is currently edited by Thai, My T.

More articles in Journal of Combinatorial Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().