کد مقاله کد نشریه سال انتشار مقاله انگلیسی نسخه تمام متن
6424496 1343395 2012 24 صفحه PDF دانلود رایگان
عنوان انگلیسی مقاله ISI
Construction of 2-factors in the middle layer of the discrete cube
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه ریاضیات ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
Construction of 2-factors in the middle layer of the discrete cube
چکیده انگلیسی

Define the middle layer graph as the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between any two vertices for which the corresponding bitstrings differ in exactly one bit. In this work we present an inductive construction of a large family of 2-factors in the middle layer graph for all n⩾1. We also investigate how the choice of certain parameters used in the construction affects the number and lengths of the cycles in the resulting 2-factor.

ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Journal of Combinatorial Theory, Series A - Volume 119, Issue 8, November 2012, Pages 1832-1855
نویسندگان
, ,