Skip to main content
SpringerLink
Log in

Saturation number of fullerene graphs

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

Saturation number of a graph G is the minimum possible size of a maximal matching in G. We establish improved upper and lower bounds on the saturation number in fullerene graphs and discuss their sharpness and quality.

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. Bollobás B. (1985) Random Graphs. Academic Press, New York

    Google Scholar 

  2. Cyvin S.J., Gutman I. (1988) Kekulé Structures in Benzenoid Hydrocarbons. Springer, Heidelberg, Lec. Notes in Chemistry

    Google Scholar 

  3. Došlić T. (1998). J. Math. Chem. 24:359

    Article  Google Scholar 

  4. Došlić T. (2002). J. Math. Chem. 31:187

    Article  Google Scholar 

  5. T. Došlić, J. Math. Chem. to appear.

  6. Edmonds J. (1965). Can. J. Math. 175:449

    Google Scholar 

  7. Fowler P.W., Manolopoulos D.E. (1995) An Atlas of Fullerenes. Clarendon Press, Oxford

    Google Scholar 

  8. E. Friedman and R. W. Pratt, New bounds for largest planar graphs with fixed maximum degree and diameter, preprint.

  9. Gordon M., Davison W.H.T. (1952). J. Chem. Phys. 20:428

    Article  CAS  Google Scholar 

  10. Graver J. (2006). Eur. J. Combin. 27:850

    Article  Google Scholar 

  11. Grünbaum B., Motzkin T.S. (1963). Can. J. Math. 15:744

    Google Scholar 

  12. Harary F. (1969) Graph Theory. Addison-Wesley, Reading, MA

    Google Scholar 

  13. Hosoya H. (1971). Bull. Chem. Soc. Jpn. 44:2332

    Article  CAS  Google Scholar 

  14. Klein D.J., Liu X. (1992). J. Math. Chem. 11:199

    Article  CAS  Google Scholar 

  15. Korte B., Hausmann D. (1978). Ann. Discrete Math. 2:65

    Article  Google Scholar 

  16. Lovász L., Plummer M.D. (1986) Matching Theory. North-Holland, Amsterdam, The Netherlands, Ann. Discr. Math. vol. 29

    Google Scholar 

  17. Maschlanka P., Volkmann L. (1996). Discrete Math. 154:167

    Article  Google Scholar 

  18. Rongsi C., Cyvin S.J., Brunvoll J., Klein D.J. (1990). Topics Curr. Chem. 153:227

    Google Scholar 

  19. Rouvret D. (1983) Chemical Application of Topology and Graph Theory. Elsevier, Amsterdam

    Google Scholar 

  20. West D.B. (1996) Introduction to Graph Theory. Prentice Hall, Upper Saddle River, NJ

    Google Scholar 

  21. Yannakakis M., Gavril F. (1980). SIAM. J. Appl. Math. 38:364

    Article  Google Scholar 

  22. Zhang H., Zhang F. (2001). J. Math. Chem. 30:343

    Article  CAS  Google Scholar 

  23. Zito M. (2003). Theor. Comput. Sc. 297:487

    Article  Google Scholar 

  24. Zito M. (1999) Research Report CS-RR-369. University of Warwick, Warwick

    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. Saturation number of fullerene graphs. J Math Chem 43, 647–657 (2008). https://doi.org/10.1007/s10910-006-9217-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10910-006-9217-3

Keywords

Search

Navigation