Embedding augmented cube into certain trees and windmill graphs

DOI10.1142/S0129054123500090MaRDI QIDQ6554734zbMATH OpenFDO

Authors A. Berin Greeni, Ramasubramanian Sundararajan, Paul Immanuel

Publication date 13 June 2024

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

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

zbMATH Keywords

augmented cubebinary treecombembeddinglobsterpathsibling treewindmill graphswirelength

Mathematics Subject Classification ID

Trees (05C05) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Embedding of hypercubes into necklace, windmill and snake graphs
• Embedding of hypercubes into banana trees
• Embedding hypercubes and folded hypercubes onto Cartesian product of certain trees
• Embeddings Between Hypercubes and Hypertrees
• Incomplete hypercubes: Embeddings of tree-related networks

Cites work

• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• An edge-isoperimetric problem for powers of the Petersen graph
• Augmented cubes
• Embedding of binomial trees in hypercubes with link faults
• Embedding of cycles and wheels into arbitrary trees
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• Exact wirelength of hypercubes on a grid
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 1303526 (Why is no real title available?)
• scientific article; zbMATH DE number 1953102 (Why is no real title available?)
• scientific article; zbMATH DE number 2060183 (Why is no real title available?)
• Implementation and Analysis of Binomial Queue Algorithms
• Introduction to algorithms
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Minimum layout of circulant graphs into certain height balanced trees
• Optimal Assignments of Numbers to Vertices
• Some simplified NP-complete graph problems
• The congestion of \(n\)-cube layout on a rectangular grid
• The cyclic cutwidth of trees
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Wirelength of hypercubes into certain trees

Cited in

(5)

• Embedding of hypercube into fractal cubic network
• Optimal layout of embedding onto folded hypercubes
• Embedding crossed cube into diverse product graphs and tree-derived architectures
• Optimization of layout for embedding complete k-partite graphs into line graphs of certain tree architectures
• An upper bound for edge congestion and the exact wirelength of embedding onto BC graphs

This page was built for publication: Embedding augmented cube into certain trees and windmill graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6554734)