<abstract xmlns="http://www.w3.org/1999/xhtml"><p> 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</p></abstract>

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

Two sufficient conditions for fractional k-deleted graphs

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

Analele ştiinţifice ale Universităţii "Ovidius" Constanţa. Seria Matematică

{"article-title":"Two sufficient conditions for fractional k-deleted graphs"}

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)...

Two sufficient conditions for fractional k-deleted graphs

Online veröffentlicht: 17. Mai 2013

Seitenbereich: 265 - 274

DOI: https://doi.org/10.2478/v10309-012-0017-4

Schlüsselwörter
operations research, independence number, minimum degree, fractional k-factor, fractional k-deleted graph

This content is open access.

Two sufficient conditions for fractional k-deleted graphs

Online veröffentlicht: 17. Mai 2013

Seitenbereich: 265 - 274

DOI: https://doi.org/10.2478/v10309-012-0017-4

Schlüsselwörteroperations research, independence number, minimum degree, fractional k-factor, fractional k-deleted graph

This content is open access.

Schlüsselwörter
operations research, independence number, minimum degree, fractional k-factor, fractional k-deleted graph