مشخصات پژوهش

عنوان	Limited packing vs tuple domination in graphs
نوع پژوهش	مقاله چاپ شده
کلیدواژه‌ها	Double domination, k-limited packing, k-tuple domination.
چکیده	In this paper we investigate the concepts of k-limited packing and k-tuple domination in graphs and give several bounds on the size of them. This bounds involve many well known parameters of graphs. Also, we establish a connection between these concepts that implies some new results in this area. Finally, we improve many bounds in literatures.
پژوهشگران	سید مهدی حسینی مقدم (نفر سوم)، بابک صمدی (نفر دوم)، دوستعلی مژده (نفر اول)