کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
4654656 | 1632831 | 2008 | 14 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Counting vertices and cubes in median graphs of circular split systems
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Median graphs are a natural generalisation of trees and hypercubes that are closely related to distributive lattices and graph retracts. In the past decade, they have become of increasing interest to the biological community, where, amongst other things, they are applied to the study of evolutionary relationships within populations.Two simple measures of complexity for a median graph are the number of vertices and the number of maximal induced subcubes. These numbers can be useful in biological applications, and they are also of purely mathematical interest. However, they can be hard to compute in general. Here we present some special families of median graphs where it is possible to find formulae and recursions for these numbers.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: European Journal of Combinatorics - Volume 29, Issue 2, February 2008, Pages 443–456
Journal: European Journal of Combinatorics - Volume 29, Issue 2, February 2008, Pages 443–456
نویسندگان
Y.B. Choe, K.T. Huber, J.H. Koolen, Y.S. Kwon, V. Moulton,