Research Info

Home /Packing parameters in graphs: ...
Title Packing parameters in graphs: new bounds and a solution to an open problem
Type JournalPaper
Keywords Packing number, Open packing number, Nordhaus–Gaddum inequality, Open problem, Triangle-free graph
Abstract In this paper,we investigate the packing parameters in graphs.By applying theMantel’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 ρo(G) = n − ω(G) posed in Hamid and Saravanakumar (Discuss Math Graph Theory 35:5–16, 2015).
Researchers Babak Samadi (Second Researcher), Doost Ali Mojdeh (First Researcher)