Abstract
Combining ?forcing? and ?global? idea, Xu et al. proposed the concepts: complete forcing set and complete forcing number of perfect matchings of graph. In this paper, we give explicit formulae for the complete forcing numbers of phenylene chains and catacondensed phenylene systems, respectively. Moreover, we present an algorithm to find the minimum complete forcing sets of these graphs.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
