  We study the distributional properties of horizontal visibility graphs
associated with random restrictive growth sequences and random set partitions
of size $n.$ Our main results are formulas expressing the expected degree of
graph nodes in terms of simple explicit functions of a finite collection of
Stirling and Bernoulli numbers.
