Embeddings Between Hypercubes and Hypertrees

DOI10.7155/jgaa.00363zbMath1323.05092OpenAlexW2408154432MaRDI QIDQ3196315

R. Sundara Rajan, Paul D. Manuel, Indra Rajasingh

Publication date: 29 October 2015

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00363

zbMATH Keywords

interconnection networkswirelength of an embedding

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph theory (including graph drawing) in computer science (68R10) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

An algorithm for embedding Turán graphs into incomplete hypercubes with minimum wirelength ⋮ Minimum Linear Arrangement of Generalized Sierpinski Graphs

This page was built for publication: Embeddings Between Hypercubes and Hypertrees