Abstract
AbstractThe investigation of self-avoiding walks on graphs has an extensive literature. We study the notion of wrong steps of self-avoiding walks on rectangular shape $$n\times m$$ n × m grids of square cells (Manhattan graphs) and examine some general and special cases. We determine the number of self-avoiding walks with one and with two wrong steps in general. We also establish some properties, like unimodality and sum of the rows of the Pascal-like triangles corresponding to the walks. We also present particular recurrence relations on the number of self-avoiding walks on the $$n\times 2$$ n × 2 grids with any specified number of wrong steps.
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.
