کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4653444 | 1632772 | 2015 | 17 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Graded sparse graphs and body-length-direction frameworks
ترجمه فارسی عنوان
نمودار های اسپردی و چارچوب جهت طول بدن
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
چکیده انگلیسی
We consider graded sparse graphs: graphs satisfying different sparsity conditions for different types of edges. We provide an inductive construction for these graphs and a decomposition into ‘graded pseudoforests’ i.e. spanning subgraphs in which each connected component contains at most one cycle and in which the edges in such a cycle are restricted by the grading. The decomposition is used to obtain combinatorial characterisations of rigidity in different types of body-length-direction frameworks. We also study graded sparse graphs from a matroid view point and derive the rank function as well as a decomposition for matroids defined by graded sparse graphs.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 46, May 2015, Pages 51–67
Journal: European Journal of Combinatorics - Volume 46, May 2015, Pages 51–67
نویسندگان
Bill Jackson, Viet Hang Nguyen,