On random Cameo graphs with independent edges Part I: path connectivity and essential diameter
classification
🧮 math.PR
keywords
cameoconnectivitydiameteressentialgraphsearlieredgesgrowth
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.