مشخصات پژوهش

صفحه نخست /Total limited packing in ...
عنوان Total limited packing in graphs
نوع پژوهش مقاله چاپ شده
کلیدواژه‌ها k-total limited packing, k-tuple domination, k-tupletotal domination
چکیده We de ne a k-total limited packing number in a graph, which generalizes the concept of open packing number in graphs, and give several bounds on it. These bounds involve many well known parameters of graphs. Also, we establish a connection among the concepts of tuple domination, tuple total domination and total limited packing that implies some results.
پژوهشگران بابک صمدی (نفر سوم)، سید مهدی حسینی مقدم (نفر اول)، دوستعلی مژده (نفر دوم)