Abstract
In this paper, we consider the entries of the bottleneck matrices of maximal outerplanar graphs. We recall patterns from [Kirkland SJ, Neumann M, Shader BL. Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra. 1996;40:311–325.] involving the entries of bottleneck matrices for trees. We first establish similar patterns involving the diagonal entries of bottleneck matrices for maximal outerplanar graphs. We then investigate patterns involving the off-diagonal entries of bottleneck matrices for maximal outerplanar graphs and establish similar results to those found in [Kirkland SJ, Neumann M, Shader BL. Characteristic vertices of weighted trees via Perron values. Linear Multilinear Algebra. 1996;40:311–325.] for trees. We close with examples illustrating our results.
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.
