Open Science Research Excellence
%0 Journal Article
%A Sizhong Zhou and  Yang Xu
%D 2010 
%J  International Journal of Mathematical and Computational Sciences
%B World Academy of Science, Engineering and Technology
%I International Science Index 43, 2010
%T Notes on Fractional k-Covered Graphs
%U http://waset.org/publications/15704
%V 43
%X 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 .
%P 971 - 973