We bound the mean distance in a connected graph which is not a tree in function of its order n and its girth g. On one hand, we show that mean distance is at most n+1 3 âˆ’ g(gâˆ’4) 12n(nâˆ’1) if g is evenâ€¦ (More)

A pseudo [2, b]-factor of a graph G is a spanning subgraph in which each component C on at least three vertices verifies 2 â‰¤ dC(x) â‰¤ b, for every vertex x in C. The main contibution of this paper, isâ€¦ (More)

Let ck(G) be the minimum number of elementary cycles of length at most k necessary to cover the vertices of a given graph G. In this work, we bound ck(G) by a function of the order of G and itsâ€¦ (More)