TY - JFULL
AU - Sizhong Zhou and Yang Xu
PY - 2010/8/
TI - Notes on Fractional k-Covered Graphs
T2 - International Journal of Mathematical and Computational Sciences
SP - 970
EP - 973
EM - zsz cumt@163.com, xuyang 825@126.com
VL - 4
SN - 1307-6892
UR - http://waset.org/publications/15704
PU - World Academy of Science, Engineering and Technology
NX - International Science Index 43, 2010
N2 - A graph G is fractional k-covered if for each edge e of
G, there exists a fractional k-factor h, such that h(e) = 1. If k = 2,
then a fractional k-covered graph is called a fractional 2-covered
graph. The binding number bind(G) is defined as follows,
bind(G) = min{|NG(X)|
|X|
: ├ÿ = X Ôèå V (G),NG(X) = V (G)}.
In this paper, it is proved that G is fractional 2-covered if δ(G) ≥ 4
and bind(G) > 5
3 .
ER -