An edge-isoperimetric problem for powers of the Petersen graph
From MaRDI portal
Publication:1575084
DOI10.1007/s000260050003zbMath0951.05053OpenAlexW1995596152MaRDI QIDQ1575084
Robert Elsässer, Sajal K. Das, Sergei L. Bezrukov
Publication date: 23 November 2000
Published in: Annals of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s000260050003
Extremal problems in graph theory (05C35) Extremal set theory (05D05) Applications of graph theory to circuits and networks (94C15) Connectivity (05C40)
Related Items
Edge-isoperimetric problems for Cartesian powers of regular graphs, Embedding complete multi-partite graphs into Cartesian product of paths and cycles, Wiener index via wirelength of an embedding, Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees, Embeddings of circulant networks, A new approach to Macaulay posets, An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength, Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path, Wirelength of embedding complete multipartite graphs into certain graphs, A branch-and-bound algorithm for the minimum cut linear arrangement problem, Pull-push method: a new approach to edge-isoperimetric problems, Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees, The edge-isoperimetric problem on the 600-vertex regular solid, Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength, On linear layout of bicube and construction of optimal incomplete bicube, Maximum subgraph problem for 3-regular Knödel graphs and its wirelength, Reflect-push methods. Part I: Two dimensional techniques, Embedding of hypercubes into necklace, windmill and snake graphs, On the optimal layout of balanced complete multipartite graphs into grids and tree related structures, Embedding of hypercubes into sibling trees, Bothway embedding of circulant network into grid, Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees, Linear wirelength of folded hypercubes, Wirelength of hypercubes into certain trees, Linear layout of locally twisted cubes, Unnamed Item, A linear time algorithm for embedding hypercube into cylinder and torus, The carving-width of generalized hypercubes, Maximum incomplete recursive circulants in graph embeddings, Node set optimization problem for complete Josephus cubes, Embedding of the folded hypercubes into tori, Embedding of recursive circulants into certain necklace graphs, Characterization of the congestion lemma on layout computation, Unnamed Item, Embedding algorithm of spined cube into grid structure and its wirelength computation, Conjectures on wirelength of hypercube into cylinder and torus
