کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
419290 683773 2015 9 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
The kk-path vertex cover of rooted product graphs
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
The kk-path vertex cover of rooted product graphs
چکیده انگلیسی

A subset SS of vertices of a graph GG is called a kk-path vertex cover if every path of order kk in GG contains at least one vertex from SS. Denote by ψk(G)ψk(G) the minimum cardinality of a kk-path vertex cover in GG. In this article a lower and an upper bound for ψkψk of the rooted product graphs are presented. Two characterizations are given when those bounds are attained. Moreover ψ2ψ2 and ψ3ψ3 are exactly determined. As a consequence the independence and the dissociation number of the rooted product are given.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 187, 31 May 2015, Pages 111–119
نویسندگان
,