Advertisement
Published in:
03-05-2019
Packing parameters in graphs: new bounds and a solution to an open problem
Published in: Journal of Combinatorial Optimization | Issue 3/2019
Log inActivate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
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).