Skip to main content
SpringerLink
Log in

Global Forcing Number of Benzenoid Graphs

  • Published:
Journal of Mathematical Chemistry Aims and scope Submit manuscript

A global forcing set in a simple connected graph G with a perfect matching is any subset S of E(G) such that the restriction of the characteristic function of perfect matchings of G on S is an injection. The number of edges in a global forcing set of the smallest cardinality is called the global forcing number of G. In this paper we prove several results concerning global forcing sets and numbers of benzenoid graphs. In particular, we prove that all catacondensed benzenoids and catafused coronoids with n hexagons have the global forcing number equal to n, and that for pericondensed benzenoids the global forcing number is always strictly smaller than the number of hexagons.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Adams P., Mahdian M., Mahmoodian E.S. (2004) Discrete Math. 281: 1–12

    Article  Google Scholar 

  2. Afshani P., Hatami H., Mahmoodian E.S. (2004) Australa. J. Comb. 30: 147–160

    Google Scholar 

  3. Balaban A.T., Liu X., Cyvin S.J., Klein D.J. (1993) J. Chem. Inf. Comput. Sci. 33: 429–436

    Article  CAS  Google Scholar 

  4. Cyvin S.J., Gutman I. (1988). Kekulé Structures in Benzenoid Hydrocarbon, Lecture Notes in Chemistry 46 Springer, Berlin

    Google Scholar 

  5. Došlić T. (1998) J. Math. Chem. 24: 359–364

    Article  Google Scholar 

  6. Došlić T. (2005) Croat. Chem. Acta 78: 251–259

    Google Scholar 

  7. Došlić T. (2005) J. Math. Chem. 38: 617–627

    Article  CAS  Google Scholar 

  8. Harary F., Klein D.J., Živković T.P. (1991) J. Math. Chem. 6: 295–306

    Article  MathSciNet  CAS  Google Scholar 

  9. Klein D.J., Randić M. (1986) J. Comput. Chem. 8: 516–521

    Article  Google Scholar 

  10. Lovász L., Plummer M.D. Matching Theory (North-Holland, Amsterdam, 1986).

  11. Pachter L., Kim P. (1998) Discrete Math. 190: 287–294

    Article  Google Scholar 

  12. Riddle M.E. (2002) Discrete Math. 245: 283–292

    Article  Google Scholar 

  13. Shiu W.C., Lam P.C.B., Zhang F., Zhang H. (2002) J. Math. Chem. 31: 405–409

    Article  MathSciNet  CAS  Google Scholar 

  14. Vukičević D., Došlić T. Global forcing number of rectangular grid graphs, submitted.

  15. Vukičević D., Kroto H.W., Randić M. (2005) Croat. Chem. Acta 78: 223–234

    Google Scholar 

  16. Vukičević D., Randić M. (2005) Chem. Phys. Lett. 401: 446–450

    Article  CAS  Google Scholar 

  17. Vukičević D., Sedlar J. (2004). Math. Comm. 9: 169–179

    Google Scholar 

  18. Zhang F.J., Li X.L. (1995) Discrete Math. 140: 253–263

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics and Mathematics, Faculty of Agriculture, University of Zagreb, Svetošimunska c. 25, 10000, Zagreb, Croatia

    Tomislav Došlić

Authors
  1. Tomislav Došlić
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tomislav Došlić.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Došlić, T. Global Forcing Number of Benzenoid Graphs. J Math Chem 41, 217–229 (2007). https://doi.org/10.1007/s10910-006-9056-2

Download citation

  • Received:

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10910-006-9056-2

Keywords

Search

Navigation