Isoperimetric inequalities and the width parameters of graphs

DOI10.1007/3-540-45071-8_39MaRDI QIDQ3082945zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

carving widthisoperimetric inequalitiespathwidthtreewidth

Mathematics Subject Classification ID

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

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

Cited in

(14)

• 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
• The bisection width and the isoperimetric number of arrays.
• The carvingwidth of hypercubes
• Isoperimetric inequalities in graphs and surfaces
• Growth and isoperimetric profile of planar graphs
• Decontamination of hypercubes by mobile agents
• Isoperimetric Inequalities for Cartesian Products of Graphs
• Discrete isoperimetric method for bandwidth, pathwidth and treewidth of hypercubes
• The carving-width of generalized hypercubes
• \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
• The treewidth and pathwidth of hypercubes
• Edge-bandwidth of grids and tori

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)