Bounds on isoperimetric values of trees

DOI10.1016/j.disc.2008.01.021zbMath1168.05013arXivmath/0701587OpenAlexW2002338850MaRDI QIDQ1011720

L. Sunil Chandran, B. V. Subramanya Bharadwaj

Publication date: 9 April 2009

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

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

zbMATH Keywords

isoperimetric problempathwidthbinary trees\(t\)-ary trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (6)

A new approach to finding the extra connectivity of graphs ⋮ On the thinness and proper thinness of a graph ⋮ The one-visibility localization game ⋮ A note on isoperimetric peaks of complete trees ⋮ Independent-set reconfiguration thresholds of hereditary graph classes ⋮ Lit-only sigma game on a line graph

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Isoperimetric invariants for product Markov chains and graph products
• Girth and treewidth
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• Sparsest cuts and bottlenecks in graphs
• The treewidth and pathwidth of hypercubes
• Edge-isoperimetric inequalities in the grid
• Some simplified NP-complete graph problems
• A note on the edges of the n-cube
• On an isoperimetric problem for Hamming graphs
• Entropy waves, the zig-zag graph product, and new constant-degree expanders
• The congestion of \(n\)-cube layout on a rectangular grid
• A lower bound for the vertex boundary-width of complete \(k\)-ary trees
• The carvingwidth of hypercubes
• Isoperimetric Inequalities for Cartesian Products of Graphs
• Optimal numberings and isoperimetric problems on graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: Bounds on isoperimetric values of trees