New infinite family of regular edge-isoperimetric graphs

DOI10.1016/j.tcs.2017.12.036zbMath1390.05197OpenAlexW2782222305MaRDI QIDQ1704594

Nikola Kuzmanovski, Pavle Bulatovic, Sergei L. Bezrukov

Publication date: 12 March 2018

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

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.12.036

zbMATH Keywords

lexicographic orderregular graphsCartesian productedge-isoperimetric problem

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)

Related Items (3)

Pull-push method: a new approach to edge-isoperimetric problems ⋮ Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees ⋮ Reflect-push methods. Part I: Two dimensional techniques

Cites Work

• Unnamed Item
• A new approach to Macaulay posets
• General edge-isoperimetric inequalities. II: A local-global principle for lexicographical solutions
• The edge-isoperimetric problem for discrete tori
• Edge-isoperimetric problems for Cartesian powers of regular graphs
• Assignment of Numbers to Vertices
• A Note on Edge Isoperimetric Numbers and Regular Graphs
• Optimal Assignments of Numbers to Vertices

This page was built for publication: New infinite family of regular edge-isoperimetric graphs