In this note, we enumerate the number of bargraphs according to the number of edges whose vertices have degree two. Such an edge is called minimal. We also determine the asymptotic behaviour for the average number of minimal edges in bargraphs in dependence on the semi-perimeter and in dependence on the area.
|Journal of Combinatorics and Number Theory
|Published - 20 Aug 2021