Regular factors of simple regular graphs and factor-spectra

被引：15

作者：

Niessen, T

Randerath, B

机构：

[1] Rhein Westfal TH Aachen, Inst Stat, D-52056 Aachen, Germany

[2] Rhein Westfal TH Aachen, Lehrstuhl Math 2, D-52056 Aachen, Germany

来源：

DISCRETE MATHEMATICS | 1998年 / 185卷 / 1-3期

关键词：

regular graph; regular factor; edge-connectivity; spectrum;

D O I：

10.1016/S0012-365X(97)00166-0

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Given integers n, r and lambda, we determine all values of k for which every simple r-regular graph of order n and with edge-connectivity lambda has a k-factor. Using this result we find for k greater than or equal to 2 the k-spectra Sp(k)(n) = {m: there exists a maximal set of m edge-disjoint k-factors of K-n} which were introduced by Hoffman et al. (1993). (C) 1998 Elsevier Science B.V. All rights reserved.

引用

页码：89 / 103

页数：15

共 15 条

[1]

[Anonymous], 1891, Acta Mathematica, DOI DOI 10.1007/BF02392606

[2]

BAEBLER F, 1938, COMMENT MATH HELV, V10, P275

[3]

BELCK HB, 1950, J REINE ANGEW MATH, V188, P228

[4] REGULAR FACTORS OF REGULAR GRAPHS [J].