Pages that link to "Item:Q1575084"

The following pages link to An edge-isoperimetric problem for powers of the Petersen graph (Q1575084):

Displaying 40 items.

• Wirelength of enhanced hypercubes into \(r\)-rooted complete binary trees (Q327683) (← links)
• Embeddings of circulant networks (Q358657) (← links)
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength (Q411854) (← links)
• Embedding of hypercubes into necklace, windmill and snake graphs (Q436587) (← links)
• Bothway embedding of circulant network into grid (Q491606) (← links)
• A new approach to Macaulay posets (Q598449) (← links)
• Linear wirelength of folded hypercubes (Q691637) (← links)
• The carving-width of generalized hypercubes (Q710586) (← links)
• The edge-isoperimetric problem on the 600-vertex regular solid (Q1399246) (← links)
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees (Q1751113) (← links)
• Wirelength of hypercubes into certain trees (Q1759856) (← links)
• Edge-isoperimetric problems for Cartesian powers of regular graphs (Q1885043) (← links)
• A branch-and-bound algorithm for the minimum cut linear arrangement problem (Q1928510) (← links)
• A linear time algorithm for embedding hypercube into cylinder and torus (Q2015139) (← links)
• Characterization of the congestion lemma on layout computation (Q2051622) (← links)
• Embedding algorithm of spined cube into grid structure and its wirelength computation (Q2072078) (← links)
• Wirelength of embedding complete multipartite graphs into certain graphs (Q2181259) (← links)
• On the optimal layout of balanced complete multipartite graphs into grids and tree related structures (Q2208343) (← links)
• Node set optimization problem for complete Josephus cubes (Q2279757) (← links)
• Conjectures on wirelength of hypercube into cylinder and torus (Q2354762) (← links)
• Embedding of hypercubes into sibling trees (Q2449051) (← links)
• Embedding of the folded hypercubes into tori (Q2516503) (← links)
• Embedding of recursive circulants into certain necklace graphs (Q2516514) (← links)
• Maximum incomplete recursive circulants in graph embeddings (Q2788730) (← links)
• (Q4944983) (← links)
• Embedding complete multi-partite graphs into Cartesian product of paths and cycles (Q5061707) (← links)
• Wiener index via wirelength of an embedding (Q5063254) (← links)
• (Q5076783) (← links)
• An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength (Q5084683) (← links)
• Minimum Linear Arrangement of the Cartesian Product of Optimal Order Graph and Path (Q5087084) (← links)
• (Q5121937) (← links)
• Linear layout of locally twisted cubes (Q5737850) (← links)
• Pull-push method: a new approach to edge-isoperimetric problems (Q6056726) (← links)
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees (Q6094514) (← links)
• On linear layout of bicube and construction of optimal incomplete bicube (Q6130207) (← links)
• Maximum subgraph problem for 3-regular Knödel graphs and its wirelength (Q6132556) (← links)
• Embedding hierarchical cubic networks into \(k\)-rooted complete binary trees for minimum wirelength (Q6492014) (← links)
• Embedding augmented cube into certain trees and windmill graphs (Q6554734) (← links)
• Fault tolerability evaluation for the component edge-connectivity of folded Petersen networks (Q6585504) (← links)
• Embedding of hypercube into fractal cubic network (Q6656779) (← links)