Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees
This paper investigates the properties of bottleneck matrices in the context of maximal outerplanar graphs (MOPGs) that share isomorphic underlying trees. The authors analyze how modifications to a given MOPG -- resulting in a non-isomorphic MOPG with the same underlying tree structure -- affect the entries of the associated bottleneck matrix. Specifically, they examine the perturbations in these matrix entries caused by such graph transformations. The theoretical findings are supported and illustrated with concrete examples.\N\NThe study contributes to the understanding of spectral and structural relationships in outerplanar graphs by exploring the interplay between graph modifications, bottleneck matrices, and their algebraic properties. The focus on maximal outerplanar graphs provides a well-defined setting for analyzing these perturbations systematically.
- A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
- Algebraic connectivity of weighted trees under perturbation
- Characteristic vertices of weighted trees via perron values
- Combinatorial Perron parameters for trees
- Combinatorial Perron values of trees and bottleneck matrices
- Distances in Weighted Trees and Group Inverse of Laplacian Matrices
- Entries of the bottleneck matrices of maximal outerplanar graphs
- Extremizing algebraic connectivity subject to graph theoretic constraints
- scientific article; zbMATH DE number 3681933 (Why is no real title available?)
- scientific article; zbMATH DE number 734901 (Why is no real title available?)
- scientific article; zbMATH DE number 4114654 (Why is no real title available?)
- scientific article; zbMATH DE number 3417498 (Why is no real title available?)
- Laplacian matrices of graphs: A survey
- Old and new results on algebraic connectivity of graphs
- Perron components and algebraic connectivity for weighted graphs
This page was built for publication: Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6997169)