Edge-isoperimetric problems for Cartesian powers of regular graphs

DOI10.1016/S0304-3975(03)00232-9zbMath1070.68114OpenAlexW1977850459MaRDI QIDQ1885043

Robert Elsässer, Sergei L. Bezrukov

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(03)00232-9

zbMATH Keywords

Cartesian productLexicographic orderIsoperimetric inequalityRegular graphsEdge-isoperimetric problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (11)

A Note on Edge Isoperimetric Numbers and Regular Graphs ⋮ Networks Synchronizability, Local Dynamics and Some Graph Invariants ⋮ The structure of the genetic code as an optimal graph clustering problem ⋮ Embeddings of circulant networks ⋮ Pull-push method: a new approach to edge-isoperimetric problems ⋮ Conductance in discrete dynamical systems ⋮ Reflect-push methods. Part I: Two dimensional techniques ⋮ New infinite family of regular edge-isoperimetric graphs ⋮ On the variance of Shannon products of graphs ⋮ Cut-off for large sums of graphs ⋮ The carving-width of generalized hypercubes

Cites Work

• Edge-isoperimetric inequalities in the grid
• General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
• An edge-isoperimetric problem for powers of the Petersen graph
• The edge-isoperimetric problem for discrete tori
• Edge isoperimetric theorems for integer point arrays
• Assignment of Numbers to Vertices
• Optimal Assignments of Numbers to Vertices
• Unnamed Item

This page was built for publication: Edge-isoperimetric problems for Cartesian powers of regular graphs