Isoperimetric inequalities and the width parameters of graphs

DOI10.1007/3-540-45071-8_39zbMATH Open1276.05103OpenAlexW1548436865MaRDI QIDQ3082945FDOQ3082945

Authors: L. Sunil Chandran, Telikepalli Kavitha, C. R. Subramanian 

Publication date: 18 March 2011

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-45071-8_39

Recommendations

• The treewidth and pathwidth of hypercubes
• A spectral lower bound for the treewidth of a graph and its consequences
• The carvingwidth of hypercubes
• The carving-width of generalized hypercubes
• Girth and treewidth

zbMATH Keywords

treewidthisoperimetric inequalitiespathwidthcarving width

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cited In (14)

• Edge-bandwidth of grids and tori
• The bisection width and the isoperimetric number of arrays.
• The carving-width of generalized hypercubes
• Isoperimetric inequalities in graphs and surfaces
• The treewidth and pathwidth of hypercubes
• Decontamination of hypercubes by mobile agents
• Isoperimetric Inequalities for Cartesian Products of Graphs
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• The carvingwidth of hypercubes
• Growth and isoperimetric profile of planar graphs
• A spectral lower bound for the treewidth of a graph and its consequences
• Isoperimetric inequalities, growth, and the spectrum of graphs
• The generalized strong isoperimetric inequality in locally finite networks
• Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes

This page was built for publication: Isoperimetric inequalities and the width parameters of graphs

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