کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4650783 | 1632441 | 2008 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Bipartite almost distance-hereditary graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Bipartite almost distance-hereditary graphs Bipartite almost distance-hereditary graphs](/preview/png/4650783.png)
چکیده انگلیسی
The notion of distance-heredity in graphs has been extended to construct the class of almost distance-hereditary graphs (an increase of the distance by one unit is allowed by induced subgraphs). These graphs have been characterized in terms of forbidden induced subgraphs [M. Aïder, Almost distance-hereditary graphs, Discrete Math. 242 (1–3) (2002) 1–16]. Since the distance in bipartite graphs cannot increase exactly by one unit, we have to adapt this notion to the bipartite case.In this paper, we define the class of bipartite almost distance-hereditary graphs (an increase of the distance by two is allowed by induced subgraphs) and obtain a characterization in terms of forbidden induced subgraphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 308, Issues 5–6, 28 March 2008, Pages 865–871
Journal: Discrete Mathematics - Volume 308, Issues 5–6, 28 March 2008, Pages 865–871
نویسندگان
Méziane Aïder,