Maximum incomplete recursive circulants in graph embeddings

DOI10.1142/S1793830915500536zbMath1331.05075OpenAlexW2246807994MaRDI QIDQ2788730

R. Sundara Rajan, T. M. Rajalaxmi, Paul D. Manuel, Mirka Miller, Indra Rajasingh

Publication date: 22 February 2016

Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s1793830915500536

zbMATH Keywords

embeddingcongestionrecursive circulantwire length

Mathematics Subject Classification ID

Distance in graphs (05C12) Graph algorithms (graph-theoretic aspects) (05C85) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Embeddings of circulant networks
• Embedding hypercubes into cylinders, snakes and caterpillars for minimizing wirelength
• Embedding of hypercubes into necklace, windmill and snake graphs
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Path embedding in star graphs
• Exact wirelength of hypercubes on a grid
• Some simplified NP-complete graph problems
• The cyclic cutwidth of trees
• Embedding ladders and caterpillars into the hypercube
• An edge-isoperimetric problem for powers of the Petersen graph
• Recursive circulants and their embeddings among hypercubes
• Wirelength of hypercubes into certain trees
• Optimal linear arrangements using betweenness variables
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• The congestion of \(n\)-cube layout on a rectangular grid
• Hamiltonian decomposition of recursive circulant graphs
• The super-connected property of recursive circulant graphs
• Minimum linear arrangement of chord graphs
• Implementation and Analysis of Binomial Queue Algorithms
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Embedding of cycles and wheels into arbitrary trees
• Embedding of special classes of circulant networks, hypercubes and generalized Petersen graphs
• Graph minimum linear arrangement by multilevel weighted edge contractions

This page was built for publication: Maximum incomplete recursive circulants in graph embeddings