Embedding augmented cube into certain trees and windmill graphs

DOI10.1142/s0129054123500090zbMATH Open1541.05123MaRDI QIDQ6554734

Ramasubramanian Sundararajan, A. Berin Greeni, Paul Immanuel

Publication date: 13 June 2024

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

zbMATH Keywords

embeddingbinary treepathwirelengthlobstercombaugmented cubewindmill graphssibling tree

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Minimum average congestion of enhanced and augmented hypercubes into complete binary trees
• Exact wirelength of hypercubes on a grid
• Some simplified NP-complete graph problems
• The cyclic cutwidth of trees
• Embedding of binomial trees in hypercubes with link faults
• An edge-isoperimetric problem for powers of the Petersen graph
• Minimum layout of circulant graphs into certain height balanced trees
• Wirelength of hypercubes into certain trees
• Wirelength of \(1\)-fault Hamiltonian graphs into wheels and fans
• Embeddings of complete binary trees into grids and extended grids with total vertex-congestion 1
• The congestion of \(n\)-cube layout on a rectangular grid
• 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
• Augmented cubes
• Optimal Assignments of Numbers to Vertices

Related Items (1)

Embedding of hypercube into fractal cubic network

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