کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9514562 | 1632609 | 2005 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
On an extension of distance-hereditary graphs
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: On an extension of distance-hereditary graphs On an extension of distance-hereditary graphs](/preview/png/9514562.png)
چکیده انگلیسی
Given a simple and finite connected graph G, the distance dG(u,v) is the length of the shortest induced {u,v}-path linking the vertices u and v in G. Bandelt and Mulder [H.J. Bandelt and H.M. Mulder, Distance Hereditary Graphs, J. Combin, Series B 41 (1986) 182-208] have characterized the class of distance hereditary graphs where the distance is preserved in each connected subgraph. In this paper, we are interested with the class of k-distance hereditary graphs (kâNâ) which consists in a parametric extension of the distance-heredity notion. We allow the distance in each connected induced subgraph to increase by at most (kâ1) unities. We provide a characterization of k-distance hereditary graphs in terms of forbidden configurations for each kâNâ.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 22, 15 October 2005, Pages 253-259
Journal: Electronic Notes in Discrete Mathematics - Volume 22, 15 October 2005, Pages 253-259
نویسندگان
Kahina Meslem, Méziane Aïder,