Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees

DOI10.1080/03081087.2024.2410994MaRDI QIDQ6997169zbMATH OpenFDO

Authors Jason J. Molitierno

Publication date 14 April 2025

Published in Linear and Multilinear Algebra (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03081087.2024.2410994

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Extremal problems in graph theory (05C35) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50)

Cites work

• 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)