Elsevier

Discrete Mathematics

Volume 312, Issue 21, 6 November 2012, Pages 3146-3163
Discrete Mathematics

Cover time of a random graph with given degree sequence

https://doi.org/10.1016/j.disc.2012.07.006Get rights and content
Under an Elsevier user license
open archive

Abstract

In this paper we establish the cover time of a random graph G(d) chosen uniformly at random from the set of graphs with vertex set [n] and degree sequence d. We show that under certain restrictions on d, the cover time of G(d) is whp asymptotic to d1d2θdnlogn. Here θ is the average degree and d is the effective minimum degree.

Keywords

Cover time
Random graphs
Degree sequence

Cited by (0)