Entries of the bottleneck matrices of maximal outerplanar graphs

DOI10.1080/03081087.2024.2386603MaRDI QIDQ7012675zbMATH OpenFDO

Authors Jason J. Molitierno

Publication date 17 March 2025

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

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

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10)

Cites work

• 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?)
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• An upper bound on the algebraic connectivity of outerplanar graphs
• Characteristic vertices of weighted trees via perron values
• Distances in Weighted Trees and Group Inverse of Laplacian Matrices
• Extremizing algebraic connectivity subject to graph theoretic constraints
• Families of graphs with twin pendent paths and the Braess edge
• Kemeny's constant and an analogue of Braess' paradox for trees
• Laplacian matrices of graphs: A survey
• Perron components and algebraic connectivity for weighted graphs
• Spanning 2-forests and resistance distance in 2-connected graphs

Cited in

(1)

• Bottleneck matrices of maximal outerplanar graphs with isomorphic underlying trees

This page was built for publication: Entries of the bottleneck matrices of maximal outerplanar graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7012675)