Abstract
In this paper, we introduce a new class of bargraphs – circular bargraphs, which are self-avoiding walks in a cylindrical lattice, and study the enumerations of them with respect to perimeter statistic. More precisely, we study the perimeter of a circular bargraph, a statistic defined naturally as the number of edges in the boundary of the bargraph. We also find an explicit formula for the total length of the perimeter over all bargraphs with n-cells.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
