Orthogonal [k-1,k+1]-factorizations in graphs

被引:2
|
作者
Liu, GZ [1 ]
Yan, GY [1 ]
机构
[1] SHANDONG UNIV,DEPT MATH,JINAN 250100,SHANDONG,PEOPLES R CHINA
关键词
D O I
10.1016/0378-3758(95)00084-4
中图分类号
O21 [概率论与数理统计]; C8 [统计学];
学科分类号
020208 ; 070103 ; 0714 ;
摘要
Let G be a graph. Let F = {F-1,F-2,...,F-d} be a factorization of G and H be a subgraph of G. If H has exactly one edge in common with F-i for all i = 1,2,...,d, then we say that F is orthogonal to H. In this paper it is proved that for any d-matching M of a [kd - 1, kd + 1]-graph G, there is a [k - 1, k + 1]-factorization of G orthogonal to M where k greater than or equal to 2 is an integer.
引用
收藏
页码:195 / 200
页数:6
相关论文
共 50 条