Two sufficient conditions for fractional k-deleted graphs

Analele Stiintifice ale Universitatii Ovidius Constanta: Seria Matematica

Lv Xiangyang¹ 

[1] School of Economics and Management Jiangsu University of Science and Technology Mengxi Road 2, Zhenjiang, Jiangsu 212003 People's Republic of China;

关键词: operations research;    independence number;    minimum degree;    fractional k-factor;    fractional k-deleted graph;   

DOI  :  10.2478/v10309-012-0017-4

来源: DOAJ

【 摘 要 】

Let G be a graph, and k a positive integer. A fractional k-factor is a way of assigning weights to the edges of a graph G (with all weights between 0 and 1) such that for each vertex the sum of the weights of the edges incident with that vertex is k. A graph G is a fractional k-deleted graph if G - e has a fractional k-factor for each e ∈ 2 E(G). In this paper, we obtain some sufficient conditions for graphs to be fractional k-deleted graphs in terms of their minimum degree and independence number. Furthermore, we show the results are best possible in some sense

【 授权许可】

Unknown