Sizhong Zhou and Yang Xu
Notes on Fractional kCovered Graphs
971 - 973
2010
4
7
International Journal of Mathematical and Computational Sciences
https://publications.waset.org/pdf/15704
https://publications.waset.org/vol/43
World Academy of Science, Engineering and Technology
A graph G is fractional kcovered if for each edge e of
G, there exists a fractional kfactor h, such that h(e) 1. If k 2,
then a fractional kcovered graph is called a fractional 2covered
graph. The binding number bind(G) is defined as follows,
bind(G) minNG(X)
X
ÿ X Ôèå V (G),NG(X) V (G).
In this paper, it is proved that G is fractional 2covered if δ(G) ≥ 4
and bind(G) > 5
3 .
Open Science Index 43, 2010