BOUNDS FOR THE COVERING NUMBER OF A GRAPH

被引：2

作者：

ABBOTT, HL

LIU, AC

机构：

[1] Department of Mathematics, University of Alberta, Edmonton

来源：

DISCRETE MATHEMATICS | 1979年 / 25卷 / 03期

关键词：

D O I：

10.1016/0012-365X(79)90083-9

中图分类号：

O1 [数学];

学科分类号：

0701 ; 070101 ;

摘要：

Upper and lower bounds for the covering number of a graph are obtained. It is shown, by probabilistic methods, that there exists a large class of graphs for which the upper bound obtained is essentially best possible. © 1979.

引用

页码：281 / 284

页数：4

共 8 条

[1]

BERGE C, 1970, GRAPHS HYPERGRAPHS

[2]

FELLER W, 1950, INTRO PROBABILITY TH, V1

[3]

HARARY F, 1969, GRAPH THEORY, pCH10

[4]

LIU CL, 1968, INTRO COMBINATORIAL, pCH9

[5] RATIO OF OPTIMAL INTEGRAL AND FRACTIONAL COVERS [J].

LOVASZ, L .

DISCRETE MATHEMATICS, 1975, 13 (04) :383-390

[6]

Nieminen J., 1974, Journal of the Institute of Mathematics and Its Applications, V14, P183

[7]

SPENCER J, 1974, J COMBINATORIAL TH A, V17, P329

[8]

Stein S. K., 1974, Journal of Combinatorial Theory, Series A, V16, P391, DOI 10.1016/0097-3165(74)90062-4

← 1 →