کد مقاله | کد نشریه | سال انتشار | مقاله انگلیسی | نسخه تمام متن |
---|---|---|---|---|
9514619 | 1632608 | 2005 | 7 صفحه PDF | دانلود رایگان |
عنوان انگلیسی مقاله ISI
Self-orthogonal decompositions of graphs into matchings
دانلود مقاله + سفارش ترجمه
دانلود مقاله ISI انگلیسی
رایگان برای ایرانیان
کلمات کلیدی
موضوعات مرتبط
مهندسی و علوم پایه
ریاضیات
ریاضیات گسسته و ترکیبات
پیش نمایش صفحه اول مقاله
چکیده انگلیسی
Given a simple graph H, a self-orthogonal decomposition (SOD) of H is a collection of subgraphs of H, all isomorphic to some graph G, such that every edge of H occurs in exactly two of the subgraphs and any two of the subgraphs share exactly one edge. Our concept of SOD is a natural generalization of the well-studied orthogonal double covers (ODC) of complete graphs. If for some given G there is an appropriate H, then our goal is to find one with as few vertices as possible. Special attention is paid to the case when G a matching with nâ1 edges. We conjecture that v(H)=2nâ2 is best possible if nâ 4 is even and v(H)=2n if n is odd. We present a construction which proves this conjecture for all but 4 of the possible residue classes of n modulo 18.
ناشر
Database: Elsevier - ScienceDirect (ساینس دایرکت)
Journal: Electronic Notes in Discrete Mathematics - Volume 23, 15 November 2005, Pages 5-11
Journal: Electronic Notes in Discrete Mathematics - Volume 23, 15 November 2005, Pages 5-11
نویسندگان
Sven Hartmann, Uwe Leck,