The vertex isoperimetric problem for the powers of the diamond graph
From MaRDI portal
Publication:2483387
DOI10.1016/j.disc.2007.04.060zbMath1162.05016OpenAlexW2049146071MaRDI QIDQ2483387
Oriol Serra, Miquel Rius, Sergei L. Bezrukov
Publication date: 28 April 2008
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2007.04.060
Related Items (3)
Lit-only \(\sigma \)-game on pseudo-trees ⋮ VERTEX ISOPERIMETRIC PARAMETER OF A COMPUTATION GRAPH ⋮ Maximum rooted connected expansion
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new approach to Macaulay posets
- Isoperimetric inequalities and fractional set systems
- The edge-isoperimetric problem for discrete tori
- A local-global principle for vertex-isoperimetric problems
- Macaulay posets
- Discrete Isoperimetric Problems
- Extremal Configurations on a Discrete Torus and a Generalization of the Generalized Macaulay Theorem
- An Ordering on the Even Discrete Torus
- Optimal numberings and isoperimetric problems on graphs
This page was built for publication: The vertex isoperimetric problem for the powers of the diamond graph