A note on isoperimetric peaks of complete trees

DOI10.1016/j.disc.2009.12.004zbMath1230.05102OpenAlexW2254786769MaRDI QIDQ966032

Imrich Vrt'o

Publication date: 27 April 2010

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

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

zbMATH Keywords

complete treeisoperimetric peak

Mathematics Subject Classification ID

Trees (05C05)

Related Items (4)

On the thinness and proper thinness of a graph ⋮ The one-visibility localization game ⋮ Hardness of approximation for crossing number ⋮ Crossing and Weighted Crossing Number of Near-Planar Graphs

Cites Work

• Bounds on isoperimetric values of trees
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees
• Edge Separators of Planar and Outerplanar Graphs With Applications

This page was built for publication: A note on isoperimetric peaks of complete trees