Abstract
The resistance distance between any two vertices of a connected graph is defined as the effective resistance between them in the electrical network constructed from the graph by replacing each edge with a unit resistor. Let $$B_n$$ denote the linear polyomino chain with $$n-1$$ squares. In this paper, first by using resistance sum rules along with series and parallel principles, explicit formulae for the resistance distances between any two vertices of $$B_n$$ are given. Then based on these formulae, the largest and the smallest resistance distances in $$B_n$$ are determined. Finally, the monotonicity and some asymptotic properties of resistance distances in $$B_n$$ are given.
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.
