2 papers
cs.DM2011
Minimum degree, independence number and pseudo [2,b]-factors in graphs
Siham Bekkai
A pseudo [2,b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices is a [2,b]-graph. The main contibution of this paper, is to give an u…
cs.DM2008
On Mean Distance and Girth
Siham Bekkai, Mekkia Kouider
We bound the mean distance in a connected graph which is not a tree in function of its order and its girth . On one hand, we show that mean distance is at most $\frac{n+1}{3…