首页 | 本学科首页   官方微博 | 高级检索  
     


Perfect matchings of a graph associated with a binary de Bruijn digraph
Authors:A. Kramer  N. Zagaglia Salvi
Affiliation:Dip. di Matematica, Politecnico di Milano, P.zza L. da Vinci 32, 20133 Milano, Italy
Abstract:Let Bn be the binary de Bruijn digraph of order n and W the quotient set of the set of vertices of Bn with respect to the equivalence relation of rotation. Let G be the graph which has W as the set of vertices and in which two elements C and H are adjacent when there exist a vertex v of C and a vertex u of H such that (v,u) is an arc of Bn. Recently the problem of establishing whether the graph G has a perfect matching was posed. In this paper we answer in the positive to this problem in the case of n odd.
Keywords:de Bruijn digraph   Composition   Matching
本文献已被 ScienceDirect 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号