On 1-factorizations of complete graphs

被引：0
|
作者：
Rad, Nader Jafari [1 ]
Musawi, Sayyed Reza [1 ]
机构：
[1] Shahrood Univ Technol, Dept Math, Shahrood, Iran
来源：
UTILITAS MATHEMATICA | 2017年 / 104卷
关键词：
1-factorization; defining set; Latin square;
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A defining set of a 1-factorization of a graph G is a set of partial 1-factors of G which may be completed to a unique 1-factorization of G. We construct defining sets of size n(2) - 3n + 4 in a 1-factorization of K-2n for each n >= 3 and give a sharp upper bound for the minimum size of a defining set among all 1-factorizations of K-2n.
引用
收藏
页码：201 / 213
页数：13
相关论文
共 50 条
12345