An upper bound on the algebraic connectivity of outerplanar graphs

DOI10.1016/J.DISC.2017.03.015zbMath1362.05073OpenAlexW2607432867MaRDI QIDQ2397528

Jason J. Molitierno

Publication date: 22 May 2017

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2017.03.015

zbMATH Keywords

Laplacian matrixalgebraic connectivityouterplanar graphvertex labelling

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Connectivity (05C40)

Cites Work

• On the algebraic connectivity of graphs as a function of genus
• Spectral partitioning works: planar graphs and finite element meshes
• Laplacian matrices of graphs: A survey
• On the Fiedler value of large planar graphs
• Isoperimetric numbers of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An upper bound on the algebraic connectivity of outerplanar graphs