کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4649490 | 1342458 | 2010 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Operator decomposition of graphs and the reconstruction conjecture
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
![عکس صفحه اول مقاله: Operator decomposition of graphs and the reconstruction conjecture Operator decomposition of graphs and the reconstruction conjecture](/preview/png/4649490.png)
چکیده انگلیسی
We present the method of proving the reconstructibility of graph classes based on the new type of decomposition of graphs — the operator decomposition. The properties of this decomposition are described. Using this decomposition we prove the following. Let PP and QQ be two hereditary graph classes such that PP is closed with respect to the operation of join and QQ is closed with respect to the operation of disjoint union. Let MM be a module of graph GG with associated partition (A,B,M)(A,B,M), where A∼MA∼M and B⁄∼MB⁄∼M, such that G[A]∈PG[A]∈P, G[B]∈QG[B]∈Q and G[M]G[M] is not (P,Q)(P,Q)-split. Then the graph GG is reconstructible.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Discrete Mathematics - Volume 310, Issue 3, 6 February 2010, Pages 423–429
Journal: Discrete Mathematics - Volume 310, Issue 3, 6 February 2010, Pages 423–429
نویسندگان
P.V. Skums, S.V. Suzdal, R.I. Tyshkevich,