An upper bound on the algebraic connectivity of outerplanar graphs

DOI10.1016/J.DISC.2017.03.015MaRDI QIDQ2397528zbMATH OpenOpenAlexFDO

Authors 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 matrixouterplanar graphalgebraic connectivityvertex labelling

Mathematics Subject Classification ID

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

Recommendations

• scientific article; zbMATH DE number 7473309
• Bounds on the algebraic connectivity of graphs
• Computing tight upper bounds on the algebraic connectivity of certain graphs
• An upper bound on algebraic connectivity of graphs with many cutpoints
• Combinatorial bounds on connectivity for dominating sets in maximal outerplanar graphs
• Bounds for the connected domination number of maximal outerplanar graphs
• Some new lower bounds on the algebraic connectivity of graphs
• A bound on the algebraic connectivity of a graph in terms of the number of cutpoints
• The Nordhaus-Gaddum bounds for algebraic connectivity of graphs
• A lower bound for the algebraic connectivity of a graph in terms of the domination number

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 854567 (Why is no real title available?)
• scientific article; zbMATH DE number 3417498 (Why is no real title available?)
• Isoperimetric numbers of graphs
• Laplacian matrices of graphs: A survey
• On the Fiedler value of large planar graphs
• On the algebraic connectivity of graphs as a function of genus
• Spectral partitioning works: planar graphs and finite element meshes

Cited in

(5)

• Acyclic reducible bounds for outerplanar graphs
• scientific article; zbMATH DE number 7473309 (Why is no real title available?)
• On the algebraic connectivity of graphs as a function of genus
• An upper bound on algebraic connectivity of graphs with many cutpoints
• On the Fiedler value of large planar graphs

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

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