On the Fiedler value of large planar graphs

DOI10.1016/j.laa.2013.05.032zbMath1282.05092arXiv1206.3870WikidataQ61732475 ScholiaQ61732475MaRDI QIDQ2435468

Clemens Huemer, Lali Barrière, David Orden, Dieter Mitsche

Publication date: 19 February 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1206.3870

zbMATH Keywords

Laplacian matrix; planar graph; algebraic connectivity; minor-free graph; Fiedler value; bounded genus graph

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

05C83: Graph minors

Related Items

Network connectivity assessment and improvement through relay node deployment, An upper bound on the algebraic connectivity of outerplanar graphs, A note on Fiedler value of classes with sublinear separators

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Spectra of graphs
• On the algebraic connectivity of graphs as a function of genus
• Spectral partitioning works: planar graphs and finite element meshes
• Old and new results on algebraic connectivity of graphs
• The extremal function for complete minors
• A note on Fiedler value of classes with sublinear separators
• The extremal function for \(K_{9}\) minors
• A separator theorem for graphs of bounded genus
• Eigenvalue bounds, spectral partitioning, and metrical deformations via flows
• A Separator Theorem for Nonplanar Graphs
• Higher Eigenvalues of Graphs
• Spectral Partitioning, Eigenvalue Bounds, and Circle Packings for Graphs of Bounded Genus
• Characteristic vertices of trees^*