کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4949763 | 1364256 | 2017 | 8 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Italian domination in trees
ترجمه فارسی عنوان
تسلط ایتالیایی درختان
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
غرور مجموعه، روم {2} - مجموعه ممتاز، درخت،
موضوعات مرتبط
مهندسی و علوم پایه
مهندسی کامپیوتر
نظریه محاسباتی و ریاضیات
چکیده انگلیسی
The Roman domination number and Italian domination number (also known as the Roman {2}-domination number) are graph labeling problems in which each vertex is labeled with either 0, 1, or 2. In the Roman domination problem, each vertex labeled 0 must be adjacent to at least one vertex labeled 2. In the Italian domination problem, each vertex labeled 0 must have the labels of the vertices in its closed neighborhood sum to at least two. The Italian domination number, γI(G), of a graph G is the minimum possible sum of such a labeling, where the sum is taken over all the vertices in G. It is known that if T is a tree with at least two vertices, then γ(T)+1â¤Î³I(T)â¤2γ(T). In this paper, we characterize the trees T for which γ(T)+1=γI(T), and we characterize the trees T for which γI(T)=2γ(T).
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 217, Part 3, 30 January 2017, Pages 557-564
Journal: Discrete Applied Mathematics - Volume 217, Part 3, 30 January 2017, Pages 557-564
نویسندگان
Michael A. Henning, William F. Klostermeyer,