Counting minimal edges in bargraphs

Suresh Elumalai, Toufik Mansour, Matthias Schork

Research output: Contribution to journalArticlepeer-review


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.
Original languageEnglish
JournalJournal of Combinatorics and Number Theory
Issue number3
StatePublished - 20 Aug 2021


Dive into the research topics of 'Counting minimal edges in bargraphs'. Together they form a unique fingerprint.

Cite this