کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6871893 681683 2016 5 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
König graphs for 3-paths and 3-cycles
موضوعات مرتبط
مهندسی و علوم پایه مهندسی کامپیوتر نظریه محاسباتی و ریاضیات
پیش نمایش صفحه اول مقاله
König graphs for 3-paths and 3-cycles
چکیده انگلیسی
Given a set X, a König graph G for X is a graph with the following property: for every induced subgraph H of G, the maximum number of vertex-disjoint induced subgraphs from X in H is equal to the minimum number of vertices whose deletion from H results in a graph containing no graph in X as an induced subgraph. The purpose of this paper is to characterize all König graphs for X, where X has only the 3-path or X consists of the 3-path and 3-cycle. We give also polynomial-time algorithms for the recognition of König graphs for the 3-path and for finding the corresponding packing and cover numbers in graphs of this type.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Applied Mathematics - Volume 204, 11 May 2016, Pages 1-5
نویسندگان
, ,