  We study growth properties of the number of paths of lenght k for a variant
of Cameo graphs introduced in an earlier paper. Sharp results are obtained for
threshold for the k-path connectivity and the essential diameter.
