An upper bound on the algebraic connectivity of outerplanar graphs
From MaRDI portal
Publication:2397528
DOI10.1016/j.disc.2017.03.015zbMath1362.05073MaRDI QIDQ2397528
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
05C10: Planar graphs; geometric and topological aspects of graph theory
05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C40: Connectivity
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