Skip to main content
Log in

Packing parameters in graphs: new bounds and a solution to an open problem

  • Published:
Journal of Combinatorial Optimization Aims and scope Submit manuscript

Abstract

In this paper, we investigate the packing parameters in graphs. By applying the Mantel’s theorem, we give upper bounds on packing and open packing numbers of triangle-free graphs along with characterizing the graphs for which the equalities hold and exhibit sharp Nordhaus–Gaddum type inequalities for packing numbers. We also solve the open problem of characterizing all connected graphs with \(\rho _{o}(G)=n-\omega (G)\) posed in Hamid and Saravanakumar (Discuss Math Graph Theory 35:5–16, 2015).

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

Access this article

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

Download references

Acknowledgements

We would like to thank the anonymous referee for his/her comments.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Babak Samadi.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Mojdeh, D.A., Samadi, B. Packing parameters in graphs: new bounds and a solution to an open problem. J Comb Optim 38, 739–747 (2019). https://doi.org/10.1007/s10878-019-00410-4

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10878-019-00410-4

Keywords

Mathematics Subject Classification

Navigation